Results 331 to 340 of about 137,584 (378)
Some of the next articles are maybe not open access.
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.
D.J. Hoitomt, P.B. Luh
openaire +2 more sources
, 1999 Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
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.
D.J. Hoitomt, J.B. Perkins, P.B. Luh
openaire +2 more sources
job shop scheduling with deadlines
Journal of Combinatorial Optimization, 1998In this paper we deal with a variant of the Job ShopScheduling Problem. We consider the addition of release dates anddeadlines to be met by all jobs. The objective is makespanminimization if there are no tardy jobs, and tardiness minimizationotherwise. The problem is approached by using a Shifting Bottleneckstrategy. The presence of deadlines motivates
BALAS E. +3 more
openaire +3 more sources
Job-Shop Sequencing and Scheduling [PDF]
, 1994 In the framework of the integrated model introduced in Chapter III, we are first interested in finding an optimal schedule in a job-shop. This difficult problem has been largely discussed in the literature for more than 20 years (see [Balas 69], [Mc Mahon et Florian 75], [Baker 87], [Carlier 78], [Lageweg et ai 77], [Barker and Mc Mahon 85] or [Carlier
Jean B. Lasserre +1 more
openaire +1 more source
Annals of operations research, 1995
The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop problems with practical features, such as ...
openaire +5 more sources
The Shifting Bottleneck procedure is an intuitive and reasonably good approximation algorithm for the notoriously difficult classical job shop scheduling problem. The principle of decomposing a classical job shop problem into a series of single-machine problems can also easily be applied to job shop problems with practical features, such as ...
openaire +5 more sources
Heuristics in Job Shop Scheduling
Management Science, 1966The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due dates are met, or failing this, the sum of lateness times is minimized. The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority ...
openaire +2 more sources
Machine Scheduling and Job Shop Scheduling [PDF]
, 2009 This chapter focuses on job shops. There are n jobs and each job visits a number of machines following a predetermined route. In some models a job may visit any given machine at most once and in other models a job may visit each machine more than once. In the latter case it is said that the job shop is subject to recirculation.
openaire +1 more source
A Review of Job Shop Scheduling
Journal of the Operational Research Society, 1966This paper discusses the more recent literature on job-shop-like sequencing problems.The types of problems can be broadly classified as "due date" or "minimum make-span" and among the solutions des...
openaire +2 more sources
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources