Results 201 to 210 of about 13,290 (262)
Some of the next articles are maybe not open access.
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +3 more sources
A genetic algorithm for job shop
Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002Genetic algorithms (GAs) constitute a technique that has been applied with advantage to a variety of combinatorial problems. This work shows how the GAs can be used to optimize the job shop problem with many tasks, many machines, and precedence constraints.
Emanuel Falkenauer, S. Bouffouix
openaire +1 more source
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
2012 International Conference on Information Technology and e-Services, 2012
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Arfi, Farid +2 more
openaire +1 more source
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Arfi, Farid +2 more
openaire +1 more source
Distributed scheduling of job shops
Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002A 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 +2 more
openaire +1 more source
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
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, 2002The 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
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
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
Optilearning for job shop problems
1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111), 2002We 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 +2 more
openaire +1 more source
Scheduling job shops with delays
Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991In 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 +2 more
openaire +1 more source