Deterministic job-shop scheduling: Past, present and future

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. © 1999 Elsevier Science B.V. All rights reserved.

[1]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[2]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, STACS.

[3]  R. Nakano,et al.  A fusion of crossover and local search , 1996, Proceedings of the IEEE International Conference on Industrial Technology (ICIT'96).

[4]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[5]  N. V. Shakhlevich,et al.  An adaptive approach in production scheduling based on the mixed graph model , 1994 .

[6]  Said Ashour,et al.  A branch-and-bound approach to the job-shop scheduling problem , 1973 .

[7]  Vladimir Cherkassky,et al.  Comparison of adaptive methods for function estimation from samples , 1996, IEEE Trans. Neural Networks.

[8]  John M. Charlton,et al.  A Generalized Machine-Scheduling Algorithm , 1970 .

[9]  David B. Porter,et al.  The gantt chart as applied to production scheduling and control , 1968 .

[10]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[11]  Norman Sadeh,et al.  Look-ahead techniques for micro-opportunistic job shop scheduling , 1992 .

[12]  Said Ashour,et al.  An Out-of-Kilter Approach for Machine Sequencing Problems , 1973 .

[13]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[14]  Ichiro Nabeshima.  GENERAL SCHEDULING ALGORITHMS WITH APPLICATIONS TO PARALLEL SCHEDULING AND MULTIPROGRAMMING SCHEDULING , 1971 .

[15]  Joyce Friedman,et al.  A Non-Numerical Approach to Production Scheduling Problems , 1955, Oper. Res..

[16]  Christian Bierwirth,et al.  A search space analysis of the Job Shop Scheduling Problem , 1999, Ann. Oper. Res..

[17]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[18]  Yoshiyasu Takefuji,et al.  Integer linear programming neural networks for job-shop scheduling , 1988, IEEE 1988 International Conference on Neural Networks.

[19]  Takeshi Yamada,et al.  The ECOlogical Framework II : Improving GA Performance At Virtually Zero Cost , 1993, ICGA.

[20]  D. Preßmar,et al.  Operations research proceedings , 1990 .

[21]  Jacobus E. Rooda,et al.  NEURAL NETWORKS FOR JOB-SHOP SCHEDULING , 1994 .

[22]  Young Hoon Lee,et al.  A hybrid approach to sequencing jobs using heuristic rules and neural networks , 1995 .

[23]  David B. Shmoys,et al.  A computational study of the job-shop and the flow-shop scheduling problems , 1993 .

[24]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[25]  Ashish Jain,et al.  A Multi-Level Hybrid Framework for the Deterministic Job-Shop Scheduling Problem , 1998 .

[26]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[27]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[28]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[29]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[30]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[31]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[32]  Norman M. Sadeh,et al.  Focused simulated annealing search: An application to job shop scheduling , 1996, Ann. Oper. Res..

[33]  Peter Brucker,et al.  On the complexity of two machine job-shop scheduling with regular objective functions , 1997 .

[34]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[35]  Svetlana A. Kravchenko.  A polynomial algorithm for a two-machine no-wait job-shop scheduling problem , 1998, Eur. J. Oper. Res..

[36]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[37]  Fred W. Glover.  Optimization by ghost image processes in neural networks , 1994, Comput. Oper. Res..

[38]  Vladimir Cherkassky,et al.  A neural network approach to job-shop scheduling , 1991, IEEE Trans. Neural Networks.

[39]  F. Glover.  Tabu Search Fundamentals and Uses , 1995 .

[40]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[41]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[42]  Li Lin,et al.  Effective job shop scheduling through active chain manipulation , 1995, Comput. Oper. Res..

[43]  Yoshikazu Nishikawa,et al.  A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to Jobshop Scheduling , 1993, PPSN.

[44]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[45]  Suraj M. Alexander.  An expert system for the selection of scheduling rules in a job shop , 1987 .

[46]  Claude Le Pape,et al.  Constraint-Based Job Shop Scheduling with IILOG SCHEDULER , 1998, J. Heuristics.

[47]  Zhen-Ping Lo,et al.  Multiple job scheduling with artificial neural networks , 1993 .

[48]  T. E. Moore,et al.  An Implicit Enumeration Algorithm for the Nonpreemptive Shop Scheduling Problem , 1974 .

[49]  Jens Clausen,et al.  Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..

[50]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[51]  Carlo Laj,et al.  Paleomagnetic rotations and continental deformation , 1988 .

[52]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

[53]  Sven Danø,et al.  Integer Linear Programming , 1974 .

[54]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[55]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[56]  Yoshiyasu Takefuji,et al.  Job-shop scheduling based on modified tank-hopfield linear programming networks , 1994 .

[57]  Mark M. Klein,et al.  Scheduling project networks , 1967, CACM.

[58]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[59]  Marc Lambrecht,et al.  Extending the shifting bottleneck procedure to real-life applications , 1996 .

[60]  François Laburthe,et al.  Disjunctive Scheduling with Task Intervals , 1995 .

[61]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[62]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[63]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[64]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[65]  Daniel L. Thomas,et al.  What is an Expert System , 1988 .

[66]  Cihan H. Dagli,et al.  Genetic neuro-scheduler: A new approach for job shop scheduling , 1995 .

[67]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[68]  E. Balas.  On the facial structure of scheduling polyhedra , 1985 .

[69]  Rory C. Flemmer,et al.  A review of artificial intelligence , 2000, 2009 4th International Conference on Autonomous Robots and Agents.

[70]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[71]  Yoshiyasu Takefuji,et al.  Scaling properties of neural networks for job-shop scheduling , 1995, Neurocomputing.

[72]  P. Brunn,et al.  Production Scheduling and Neural Networks , 1995 .

[73]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[74]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[75]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[76]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[77]  Bruce E. Rosen,et al.  A simulated annealing approach to job shop scheduling using critical block transition operators , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[78]  Wallace Clark,et al.  The Gantt chart : a working tool of management , 2022 .

[79]  Hirotaka Hara.  Job Shop Scheduling by Minimal Conflict Search , 1995 .

[80]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[81]  Jan Karel Lenstra,et al.  A local search template , 1998, Comput. Oper. Res..

[82]  Wolfgang Spohn,et al.  The Representation of , 1986 .

[83]  Said Ashour.  A DECOMPOSITION APPROACH FOR THE MACHINE SCHEDULING PROBLEM , 1967 .

[84]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[85]  J. Carlier.  The one-machine sequencing problem , 1982 .

[86]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

[87]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[88]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[89]  Marc M. Van Hulle.  A Goal Programming Network for Mixed Integer Linear Programming: a CaseStudy for the Job-Shop Scheduling Problem , 1991, Int. J. Neural Syst..

[90]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[91]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[92]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[93]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[94]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[95]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[96]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[97]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[98]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[99]  Ulrich A. W. Tetzlaff,et al.  Constraint Propagation Based Scheduling of Job Shops , 1996, INFORMS J. Comput..

[100]  Natalia V. Shakhlevich,et al.  NP-hardness of Shop-scheduling Problems with Three Jobs , 1995, Discret. Appl. Math..

[101]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[102]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[103]  Reha Uzsoy,et al.  Decomposition methods for scheduling semiconductor testing facilities , 1996 .

[104]  Kenneth Alan Pasch,et al.  Heuristics for job-shop scheduling , 1988 .

[105]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[106]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[107]  K. T. Yeo,et al.  An expert neural network system for dynamic job shop scheduling , 1994 .

[108]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[109]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

[110]  Alexander H. G. Rinnooy Kan,et al.  The Design, Analysis and Implementation of Heuristics , 1988 .

[111]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[112]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[113]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[114]  Y. N. Sotskov,et al.  Software for production scheduling based on the mixed [multi]graph approach , 1996 .

[115]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[116]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[117]  K. S. Hindi,et al.  A review of artificial intelligence-based job-shop scheduling systems , 1991 .

[118]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[119]  Fred W. Glover,et al.  Surrogate Constraints , 1968, Oper. Res..

[120]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[121]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[122]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[123]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[124]  JainAnant Singh,et al.  New and Stronger Job-Shop Neighbourhoods , 2000 .

[125]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[126]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[127]  Yih-Long Chang,et al.  Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment , 1996 .

[128]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[129]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[130]  Natalia V. Shakhlevich,et al.  A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs , 1995 .

[131]  Christian Bierwirth,et al.  Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals , 1994, PPSN.

[132]  T. Yamada,et al.  Job shop scheduling , 1997 .

[133]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[134]  J. M. van den Akker,et al.  LP-based solution methods for single-machine scheduling problems , 1994 .

[135]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[136]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..

[137]  Fred Glover,et al.  Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..

[138]  Peter Brucker,et al.  A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs , 1994 .

[139]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

[140]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[141]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[142]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[143]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[144]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[145]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[146]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[147]  K. Preston White,et al.  A recent survey of production scheduling , 1988, IEEE Trans. Syst. Man Cybern..

[148]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[149]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[150]  Wieslaw Kubiak,et al.  Total completion time minimization in two-machine job shops with unit-time operations , 1996 .

[151]  Norman Sadeh,et al.  Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing , 1997 .

[152]  Yuri N. Sotskov,et al.  Optimal makespan schedule for three jobs on two machines , 1996, Math. Methods Oper. Res..

[153]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[154]  John E. Biegel,et al.  Expert systems can do job shop scheduling: an exploration and a proposal , 1989 .

[155]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[156]  Yu. N. Sotskov,et al.  Mixed multigraph approach to scheduling jobs on machines of different types , 1997 .

[157]  Reha Uzsoy,et al.  Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study , 1996 .

[158]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[159]  Robert H. Storer,et al.  Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..

[160]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[161]  Roberto Tadei,et al.  Solving a real world project scheduling problem with a genetic approach , 1994 .

[162]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[163]  NowickiEugeniusz,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[164]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[165]  Egon Balas,et al.  Job Shop Scheduling With Deadlines , 1998, J. Comb. Optim..

[166]  J. Erschler,et al.  Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..

[167]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[168]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[169]  T. Watanabe,et al.  Job-shop scheduling using neural networks , 1993 .

[170]  Stéphane Dauzère-Pérès,et al.  A procedure for the one-machine sequencing problem with dependent jobs , 1995 .

[171]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[172]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[173]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[174]  Bernard Grabot,et al.  Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach , 1994 .

[175]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[176]  V. Tikhomirov.  On the Representation of Continuous Functions of Several Variables as Superpositions of Continuous Functions of one Variable and Addition , 1991 .

[177]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[178]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[179]  Reha Uzsoy,et al.  A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .

[180]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[181]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[182]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[183]  J. Proth,et al.  A splitting-up approach to simplify job-shop scheduling problems , 1992 .

[184]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[185]  George L. Nemhauser,et al.  A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .

[186]  Katsumi Morikawa,et al.  Neural network approach for minimizing the makespan of the general job-shop , 1994 .

[187]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[188]  M. Florian,et al.  On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

[189]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[190]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[191]  K. Preston White,et al.  Job-shop scheduling: limits of the binary disjunctive formulation , 1990 .

[192]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[193]  Philippe Baptiste,et al.  A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[194]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[195]  W. Hopper,et al.  Insertion techniques. , 1995, Primary care.

[196]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[197]  John E. Beasley,et al.  Obtaining test problems via Internet , 1996, J. Glob. Optim..

[198]  Helena Ramalhinho Dias Lourenço,et al.  Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem , 1996 .

[199]  N. S. Barnett,et al.  Private communication , 1969 .

[200]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[201]  S. L. van de Velde,et al.  Machine scheduling and Lagrangian relaxation , 1991 .

[202]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[203]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. I. Problem representation , 1988, IEEE 1988 International Conference on Neural Networks.

[204]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[205]  Fred Glover,et al.  PROBABILISTIC AND PARAMETRIC LEARNING COMBINATIONS OF LOCAL JOB SHOP SCHEDULING RULES , 1963 .

[206]  N. V. Shakhlevich,et al.  Adaptive scheduling algorithm based on mixed graph model , 1996 .

[207]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[208]  Amar Ramudhin,et al.  The generalized Shifting Bottleneck Procedure , 1996 .

[209]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[210]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[211]  John M. Charlton,et al.  A Method of Solution for General Machine-Scheduling Problems , 1970, Oper. Res..

[212]  Jan Karel Lenstra,et al.  Sequencing by enumerative methods , 1977 .

[213]  John L. Burbidge,et al.  Production planning and control: A personal philosophy , 1985 .

[214]  Iie Amar Dev Amar Senior Member,et al.  Simulated Versus Real Life Data in Testing the Efficiency of Scheduling Algorithms , 1986 .

[215]  Alan F. Murray,et al.  IEEE International Conference on Neural Networks , 1997 .

[216]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[217]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[218]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[219]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[220]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[221]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. II. architecture and simulations , 1988, IEEE 1988 International Conference on Neural Networks.

[222]  Emile H. L. Aarts,et al.  Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling , 1994, European Conference on Artificial Intelligence.

[223]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[224]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[225]  Wlodzimierz Szwarc,et al.  SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .

[226]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[227]  Andrew Kusiak,et al.  Expert systems for planning and scheduling manufacturing systems , 1988 .

[228]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[229]  Rjm Rob Vaessens.  Generalized job shop scheduling : complexity and local search , 1995 .

[230]  I. Adiri,et al.  An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem , 1982, Math. Oper. Res..

[231]  Norman M. Sadeh,et al.  Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..

[232]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[233]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[234]  David B. Shmoys,et al.  A time-oriented approach to computing optimal schedules for the job-shop scheduling problem , 1996 .

[235]  Peter Brucker,et al.  Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..