A genetic-search-guided greedy algorithm for multi-resource shop scheduling with resource flexibility

References

• Akers , S. B. 1956 . A graphical approach to production scheduling problems . Operations Research , 4 : 244 – 245 .
   Web of Science ®Google Scholar
• Brandimarte , P. 1993 . Routing and scheduling in a flexible job shop by tabu search . Annals of Operations Research , 41 : 157 – 183 .
   Google Scholar
• Brucker , P. 1998 . Scheduling Algorithms , Berlin : Springer-Verlag .
   Google Scholar
• Brucker , P. and Neyer , J. 1998 . Tabu search for the multi-mode job-shop problem . Operations Research Spektrum , 20 : 21 – 28 .
   Google Scholar
• Brucker , P. and Schlie , R. 1990 . Job-shop scheduling with multi-purpose machines . Computing , 45 : 369 – 375 .
   Web of Science ®Google Scholar
• Dauzère-Pérès , S. and Paulli , J. 1994 . Solving the general multi-processor job-shop scheduling problem , Management Report Series 182 The Netherlands : Rotterdam School of Management, Erasmus Universiteit Rotterdam .
   Google Scholar
• Dauzère-Pérès , S. and Paulli , J. 1997 . An integrated approach for modeling and solving the multiprocessor job-shop scheduling problem using tabu search . Annals of Operations Research , 70 : 281 – 306 .
   Web of Science ®Google Scholar
• Dauzère-Pérès , S. , Roux , W. and Lasserre , J. B. 1998 . Multi-resource shop scheduling with resource flexibility . European Journal of Operational Research , 107 : 289 – 305 .
   Web of Science ®Google Scholar
• Hurink , J. B. , Jurisch , B. and Thole , M. 1994 . Tabu search for the job-shop scheduling problem with multi-purpose machines . Operations Research Spektrum , 15 : 205 – 215 .
   Google Scholar
• Lawrence , S. 1984 . Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques , Pittsburgh , PA : GSIA, Carnegie-Mellon University . Technical report
   Google Scholar
• Mastrolilli , M. and Gambardella , L. M. 2000 . Effective neighborhood functions for the flexible job shop problem . Journal of Scheduling , 3 ( 1 ) : 3 – 20 .
   Google Scholar
• Mati , Y. , Rezg , N. and Xie , X. L. 2001 . Geometric approach and tabu search for scheduling flexible manufacturing systems . IEEE Transactions on Robotics and Automation , 17 ( 6 ) : 805 – 818 .
   Google Scholar
• Mati , Y. and Xie , X. L. 2002 . Computational results for multi-resource shop scheduling with resource flexibility , Nantes , , France : Ecoles des Mines de Nantes . Technical report
   Google Scholar
• Mati , Y. and Xie , X. L. 2004 . The complexity of two-job shop problems with multi-purpose unrelated machines . European Journal of Operational Research , 152 : 159 – 169 .
   Web of Science ®Google Scholar
• Oliver , I. M. , Smith , D. J. and Holland , J. R. C. 1987 . A study of permutation crossover operators on the traveling salesman problem , Dallas , TX : Texas Instruments Ltd. . Technical report
   Google Scholar
• Ovacik , I. M. and Uzsoy , R. 1998 . Decomposition Methods for Complex Factory Scheduling Problems , Boston , MA : Kluwer .
   Google Scholar
• Paulli , J. 1995 . A hierarchical approach for the FMS scheduling problem . European Journal of Operational Research , 86 : 32 – 42 .
   Web of Science ®Google Scholar