## Deterministic Job-Shop Scheduling: Past, Present and Future (1998)

Venue: | European Journal of Operational Research |

Citations: | 66 - 2 self |

### BibTeX

@ARTICLE{Jain98deterministicjob-shop,

author = {A. S. Jain and S. Meeran},

title = {Deterministic Job-Shop Scheduling: Past, Present and Future},

journal = {European Journal of Operational Research},

year = {1998},

volume = {113},

pages = {390--434}

}

### Years of Citing Articles

### OpenURL

### Abstract

:- Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided. KEYWORDS:- Scheduling Theory; Job-Shop; Review; Computational Study; 1. INTRODUCTION Current market trends such as consumer demand for variety, shorter product life cycles and competitive pressure to reduce costs have resulted in the need for zero i...

### Citations

475 |
The complexity of theorem proving procedures
- Cook
- 1971
(Show Context)
Citation Context ... time requirement of order O(x y ) is said to have a polynomial complexity and is denoted by P. Whereas if the problem complexity is of order O(y x ) then it is considered to be NP-Hard (if P �� N=-=P) (Cook 1971-=-; Garey et al. 1976). Here an optimal algorithm would require a number of computational steps that grows exponentially with the input. The common belief is that no efficient algorithm can ever possibl... |

328 | Performance of various computers using standard linear equations software,”Report CS-89-85 - Dongarra |

304 | Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annab of DUcnte Mothematics - Graham, Lawlet, et al. - 1979 |

277 |
OR-Library: Distributing test problems by electronic mail
- Beasley
- 1990
(Show Context)
Citation Context ... values. Hence given the seed values and the interval of the processing times these problems can be generated by anyone. This section describes all the known benchmark problems for P J , 242 of them (=-=Beasley 1990-=-, 1996), highlighting optimal or, in the case of open problems, best solutions and the first author(s) to achieve these bounds. Attention is initially drawn to FT 10, the most famous benchmark instanc... |

272 |
Tabu Search-Part II
- Glover
- 1990
(Show Context)
Citation Context ...t they allow perturbations to non improving schedules and hence are able to transcend local optima. Not surprisingly such methods are considered to be far superior to current BB and AI methodologies (=-=Glover 1990-=-; Nowicki and Smutnicki 1996). The prominence of iterated local search techniques is clearly brought out by the works of Laguna et al. (1991, 1993) in which a TS technique is compared with a BB approa... |

264 |
Sequencing and scheduling: algorithms and complexity
- Lawler, Lenstra, et al.
- 1993
(Show Context)
Citation Context ...e inherently hard problems. Even most of the special cases of P J are also NP-Hard or strongly NP-Hard which makes this problem one of the most stubborn members of this class (Nakano and Yamada 1991; =-=Lawler et al. 1993-=-). This is highlighted by the fact that algorithms can optimally solve other NP instances such as randomly generated travelling salesman problems, with more than 4000 cities, and set covering problems... |

260 | Limited discrepancy search - Harvey, Ginsberg - 1995 |

229 | Future paths for integer programming and links to artificial intelligence - Glover - 1986 |

195 | How easy is local search - Johnson, Papadimitriou, et al. - 1988 |

187 | On evolution, search, optimization, genetic algorithms and martial arts, towards memetic algorithms
- Moscato
- 1989
(Show Context)
Citation Context ...l.s1991);sGeneticsAlgorithmss(GAs)s(Falkenauersand Deterministic Job-Shop Scheduling: Past, Present and Future 03/10/98 page(9) Bouffouix 1991; Nakano and Yamada 1991) and Genetic Local Search (GLS) (=-=Moscato 1989-=-; Aartssetsal.s1991)swhichsaresdescribedslatersinsthisspaper.sThesmainscontributionsofsthese workssissthesnotionsofslocalssearchs(Johnsonsetsal.s1988;sYannakakiss1990)stosP J .sInslocal search methods... |

169 | Complexity of machine scheduling problems - Lenstra, Kan, et al. - 1977 |

166 |
The shifting bottleneck procedure for job shop scheduling
- Adams, Balas
- 1988
(Show Context)
Citation Context ...o the test findings may suggest the improvements required and where they should be made. These benchmark problems are formulated by various authors (Fisher and Thompson 1963 (FT); Lawrence 1984 (LA); =-=Adams et al. 1988-=- (ABZ); Applegate and Cook 1991 (ORB); Storer et al. 1992 (SWV); Yamada and Nakano 1992 (YN); Taillard 1993 (TA); Demirkol et al. 1998 (DMU)) and are freely available. 2 The processing times for these... |

164 | Heuristics for integer programming using surrogate constraints - Glover - 1977 |

163 |
A computational study of the job-shop scheduling problem
- Applegate, Cook
- 1991
(Show Context)
Citation Context ...timesthe optimal solution to FT 10 (sees3.1),sasproblem that had been eluding researchers for over 25 years. EvenslargersinstancessthansFT 10 were solved bysother BB methods (CarliersandsPinsons1990; =-=Applegate and Cook 1991-=-).sPriorsto 1988sthesonlystechniquesavailablestossolvesinstancesswithsmoresthans100soperationsswas priority dispatch rules (Lawrence 1984). Fox (1987) and Sadeh (1991) werestacklingsproblemssfromsansi... |

159 | Constraint-directed search: A case study of job-shop scheduling - Fox - 1983 |

128 | A Fast Taboo Search Algorithm for the Job Shop Problem - Nowicki, Smutnicki - 1996 |

119 |
The complexity of flow shop and job shop scheduling
- Garey, Johnson, et al.
- 1976
(Show Context)
Citation Context ...rement of order O(x y ) is said to have a polynomial complexity and is denoted by P. Whereas if the problem complexity is of order O(y x ) then it is considered to be NP-Hard (if P �� NP) (Cook 19=-=71; Garey et al. 1976-=-). Here an optimal algorithm would require a number of computational steps that grows exponentially with the input. The common belief is that no efficient algorithm can ever possibly be found to solve... |

119 | Testing heuristics: We have it all wrong - Hooker - 1995 |

117 |
Incorporating problem specific knowledge into genetic algorithms
- Grefenstette
- 1987
(Show Context)
Citation Context ...thodssaresunablestosconvergestosansoptimal solution. These deficienciessinitiatedsthe work on GeneticsLocalsSearchs(GLS), whichsissalso referred to as population based local search or memetic search (=-=Grefenstette 1987-=-; Moscato 1989;sUldersetsal.s1990,s1991).sGLSsissastwoslevelslocalssearchstechniqueswheresaschild conceived from the GA operators is used as the initial solution for the subsequent local search. The l... |

115 | Disjunctive programming - Balas - 1979 |

115 | Job-shop Scheduling with Genetic Algorithms - Davis - 1985 |

112 |
Optimal two and three-stage production schedules with setup times included
- Johnson
- 1954
(Show Context)
Citation Context ...graph. Nevertheless there were earlier works in job-shop scheduling. Giffler and Thompson (1960) proposed a priority dispatch rule template, Jackson (1956) generalised Johnsons's flow-shop algorithm (=-=Johnson 1954-=-) to the job-shop and Akers and Friedman (1955) applied a Boolean Algebra approach in order to represent processing sequences. These works dealt with a problem consisting of n jobs, m machines and pre... |

110 |
Probabilistic Learning Combinations of Local Job Shop Scheduling Rules
- Crowston, Thompson, et al.
- 1963
(Show Context)
Citation Context ...method by testing it on the benchmark problems. Also the test findings may suggest the improvements required and where they should be made. These benchmark problems are formulated by various authors (=-=Fisher and Thompson 1963-=- (FT); Lawrence 1984 (LA); Adams et al. 1988 (ABZ); Applegate and Cook 1991 (ORB); Storer et al. 1992 (SWV); Yamada and Nakano 1992 (YN); Taillard 1993 (TA); Demirkol et al. 1998 (DMU)) and are freely... |

104 | Designing and reporting on computational experiments with heuristic methods - Barr, Golden, et al. - 1995 |

99 |
Supplement to ”Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling
- Lawrence
- 1984
(Show Context)
Citation Context ...solved bysother BB methods (CarliersandsPinsons1990; Applegate and Cook 1991).sPriorsto 1988sthesonlystechniquesavailablestossolvesinstancesswithsmoresthans100soperationsswas priority dispatch rules (=-=Lawrence 1984-=-). Fox (1987) and Sadeh (1991) werestacklingsproblemssfromsansindustrialsperspective usingsConstraintsSatisfactionstechniquesswhilesneuralsnetworks(NN)sapplicationss(Foosand Takefuji 1988a, b, c; Zhou... |

95 | Improved CLP Scheduling with Task Intervals - CASEAU, LABURTHE - 1994 |

92 | Adjustment of Heads and Tails for the JobShop Problem - Carlier, Pinson |

92 | Large-step markov chains for the traveling salesman problem - Martin, Otto, et al. - 1991 |

91 | A practical use of Jackson’s preemptive schedule for solving the job-shop problem - Carlier, Pinson - 1990 |

87 |
Applying tabu-search to the job-shop scheduling problem
- Dell’Amico, Trubian
- 1993
(Show Context)
Citation Context ...rithm does not include the initial solution. As the initial solution has a complexity of O(n 3 m 5 ) Aarts (1996) indicates that this is somewhat misleading, to put it midly. The other TS strategies (=-=Dell'Amico and Trubian 1993-=-; Taillard 1994; Barnes and Chambers 1995), although not presented here, are all integrated with several other methods and are able to provide solutions of high quality within reasonable computing tim... |

82 | Improved Approximation Algorithms for Shop Scheduling Problems - Shmoys, Stein, et al. - 1994 |

81 | Ant System for job-shop scheduling - Colorni, Dorigo, et al. - 1994 |

79 | A Promising Genetic Algorithm Approach to Job-Shop Scheduling - Fang, Ross, et al. - 1993 |

78 | A new approach to computing optimal schedules for the job-shop scheduling problem - Martin, Shmoys - 1996 |

70 | Algorithms for solving production scheduling problems - Giffler, GL - 1960 |

69 |
A branch and bound algorithm for the job-shop scheduling problem Discrete
- BRUCKER, JURISCH, et al.
- 1994
(Show Context)
Citation Context ... the difficulty is highlighted by the fact that 15!siss360,360stimesslargersthans10!.sManysmethodsswhichsadoptsunsophisticated techniques are unable to cope with this factorial increase. For example (=-=Brucker et al. 1994-=-) require to find the position of every preceding and succeeding operation on each critical block beforesbranching.sAssasresultsforsmanyslargesproblemssthessearchsissterminatedsbeforeseach positionsca... |

64 |
On representation of continuous functions of several variables as superposition of continuous functions of one variable and addition
- Kolmogorov
- 1957
(Show Context)
Citation Context ...e fact that many hard problems have been insurmountable for decades before finally being solved. A perfect example is Hilbert's 13 th problem (Hilbert 1900) which was eventually solved by Kolmogorov (=-=Kolmogorov 1957-=-). 3. BENCHMARK PROBLEMS In the previous section we have briefly described various techniques and algorithms which are used to solve P J . However to find the comparative merits of these techniques an... |

64 |
New Search Spaces for Sequencing Problems With Application to Job Shop Scheduling”, Management Science 38
- Storer, Wu, et al.
- 1992
(Show Context)
Citation Context ... differentsstartingssolutions,susingsfastsproblem-specificsconstructivesprocedures,swhichsare then improved byslocalssearch.sThissclasssofstechniquessincludesproblemsandsheuristicsspace based search (=-=Storer et al. 1992-=-, 1995) and greedy random adaptive search procedure (GRASP) (Resende 1997). ThesmostspopularsiterativesmethodssaresThresholdsAlgorithmsswhichschoosesasnew configuration if the difference in cost betwe... |

63 |
A survey of scheduling rules
- Panwalkar, Iskander
- 1977
(Show Context)
Citation Context ... available to be sequenced and then choose the operation with the highestspriority.sTheysaresveryseasystosimplementsandshavesaslowscomputationsburden.sA plethora of different rules have been created (=-=Panwalkar and Iskander 1977-=-) and the research appliedsinsthissdomainsindicatessthatsthesbeststechniquessinvolvesaslinearsorsrandomised combinationsofsseveralsprioritysdispatchsruless(FishersandsThompsons1963;sPanwalkarsand Iska... |

62 |
Conventional Genetic Algorithms for Job-Shop Problems
- Nakano, Yamada
- 1991
(Show Context)
Citation Context ...y be found to solve these inherently hard problems. Even most of the special cases of P J are also NP-Hard or strongly NP-Hard which makes this problem one of the most stubborn members of this class (=-=Nakano and Yamada 1991-=-; Lawler et al. 1993). This is highlighted by the fact that algorithms can optimally solve other NP instances such as randomly generated travelling salesman problems, with more than 4000 cities, and s... |

58 | A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling - Baptiste, Pape - 1995 |

58 | Large-step markov chains for the tsp incorporating local search heuristics - Martin, Otto, et al. - 1992 |

54 | Nonsystematic backtracking search - Harvey - 1995 |

51 | Scheduling project networks with resource constraints and time - Bartusch, Mohring, et al. - 1988 |

51 | The job shop scheduling problem: Conventional and new solution techniques - Blazewicz, Domschke - 1996 |

51 | Evolution Based Learning in a Job Shop Scheduling Environment - Dorndorf, Pesch - 1992 |

51 | Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem - Sadeh, Fox - 1996 |

50 |
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Balas, Vazacopoulos
- 1998
(Show Context)
Citation Context ...ed much of the initial excitement in the boom period then notssurprisinglysthissprocedureshassbeensincorporatedsinsmanysothersworkss(Causeausand Laburthe 1995; Yamada and Nakano 1996a; Vaessens 1996; =-=Balas and Vazacopoulos 1998-=-) which have improved the upper and lower bounds of several hard problems. SBP has also been appliedstosmanysgeneralisationssofsP J .sForsexamplesMortons(1990)sextendssSBPstosproject scheduling and ap... |

49 | A computational study of local search algorithms for job shop scheduling - Aarts, Laarhoven, et al. - 1994 |

46 | The onemachine sequencing problem - Carlier - 1982 |