Results 241 to 250 of about 41,258 (298)

A Theory of Job Shopping

The Quarterly Journal of Economics, 1978
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire   +2 more sources

Scheduling the dynamic job shop

[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The augmented Lagrangian decomposition and coordination technique is applied to a continuous-time formulation of the scheduling problem in a job shop environment. This methodology generates a variety of information that can be used to initialize the algorithm after changes occur, including Lagrange multipliers.
Debra J. Hoitomt, Peter B. Luh
openaire   +1 more source

A Periodic Job Shop Model

IFAC Proceedings Volumes, 1989
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire   +2 more sources

Distributed scheduling of job shops

Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002
A distributed job shop scheduling algorithm has been implemented in the LAN (local area network) environment. The algorithm is a good candidate for distributed implementation since much of the computation time required for a solution is expended in distributable portions of the algorithm.
Debra J. Hoitomt, James B. Perkins, Peter B. Luh   +2 more
openaire   +1 more source

Optilearning for job shop problems

1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111), 2002
We exploit the two distinguishing features of Boltzmann machines-plasticity of connections and concentration of equilibrium states around the minima of a loss function-for designing an optimization algorithm where the neural network learns to suitably locate its equilibrium state on the target of the optimization problem. The algorithm is structured in
Bruno Apolloni, S. Bolis, Anna Maria Zanaboni   +2 more
openaire   +1 more source

Scheduling job shops with delays

Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991
In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Sheldon X. C. Lou, Garrett J. van Ryzin, Stanley B. Gershwin   +2 more
openaire   +1 more source

Optimal Configurations of General Job Shops

Queueing Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avi Giloni, Sridhar Seshadri
openaire   +1 more source

Job shop scheduling

1997
Scheduling is the allocation of shared resources over time to competing activities, and has been the subject of a significant amount of literature in the operations research field. Emphasis has been on investigating machine scheduling problems where jobs represent activities and machines represent resources; each machine can process at most one job at ...
T. Yamada, R. Nakano
openaire   +2 more sources

Practical job shop scheduling

Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Lot Streaming in Job-Shop Scheduling

Operations Research, 1997
The issue in Lot Streaming is how to split lots into sublots in order to improve the makespan (or some other criterion). We present a model and an iterative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublots on the machines, and a standard job-shop scheduling ...
Stéphane Dauzère-Pérès, Jean-Bernard Lasserre   +1 more
openaire   +1 more source