Scheduling jobs in shops with multi-purpose machines

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

[2]  L. Goddard,et al.  Operations Research (OR) , 2007 .

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

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

[5]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[6]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

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

[8]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

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

[10]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

[11]  Teofilo F. Gonzalez,et al.  A Note on Open Shop Preemptive Schedules , 1979, IEEE Transactions on Computers.

[12]  Dell'AmicoMauro,et al.  Applying tabu search to the job-shop scheduling problem , 1993 .

[13]  W. Kubiak,et al.  A Note On The Complexity Of Openshop Scheduling Problems , 1991 .

[14]  Eugene L. Lawler,et al.  Minimizing Maximum Lateness in a Two-Machine Open Shop , 1979, Math. Oper. Res..

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

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

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

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

[19]  SahniSartaj,et al.  Open Shop Scheduling to Minimize Finish Time , 1976 .

[20]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[21]  Wolfgang Meyer.  Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen , 1992 .

[22]  Johann Hurink,et al.  Polygon Scheduling , 1996, Discret. Appl. Math..

[23]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[24]  Keith G. Lockyer,et al.  A practical approach to production scheduling , 1979 .

[25]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[26]  Peter Brucker,et al.  The job-shop problem and immediate selection , 1994, Ann. Oper. Res..

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

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

[29]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.