Scheduling larger job shops: a decomposition approach

References

• ADAMS. J., BALAS , E. and ZAWACK , D. , 1988 , The shifting bottleneck procedure for job shop scheduling . Management Science , 34 , 391 – 401 .
   Google Scholar
• APPLEGATE, D and COOK , W. , 1991 , A computation study of the job-shop scheduling problem . ORSA Journal on Computing , 3 , 149 – 156 .
   Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York Wiley ).
   Google Scholar
• BASAK , J. , 1990 , Decompositions of Graphs ( Boston Kluwer Academic ).
   Google Scholar
• CARLIER. J. and PINSON , E. , 1989 , An algorithm for solving the job-shop problem . Management Science , 35 , 164 – 176 .
   Google Scholar
• CHU. C, PORTMAN , M. C. and PROTH , J. M. , 1992 , A splitting-up approach to simplify job-shop scheduling problems . International Journal of Production Research , 30 , 859 – 870 .
   Google Scholar
• CONWAY , R. W. , MAXWELL , W. L. and MILLER , L. W. , 1967 , Theory of Scheduling ( Reading , Mass. Addison-Wesley ).
   Google Scholar
• GAREY , M. R. and JOHNSON , D. S. , 1979 , Computers and Intractability ( San Francisco , CA Freeman ).
   Google Scholar
• GIFFLER. B. and THOMPSON , G. L. , 1960 , Algorithm for solving production scheduling problems . Operations Research , 8 , 487 – 503 .
   Google Scholar
• GLOVER , F. , 1986 , Future paths for integer programming and links to artificial intelligence . Computers and Operations Research , 1 , 533 – 549 .
   Web of Science ®Google Scholar
• GLOVER. F., 1989 a, Tabu search, Part I , ORSA Journal on Computing , 1 , 190 – 206 .
   Google Scholar
• GLOVER , F. , 1986 b, Tabu search, Part II , ORSA Journal on Computing , 2 , 4 – 32 .
   Google Scholar
• JAMSHIDI , M. , 1983 , Large-Scale Systems; Modelling and Control ( New York North-Holland ).
   Google Scholar
• JONES. A.T., and MCLLEAN , C.R. , 1986 , A proposed hierarchical control model for automated manufacturing systems Journal of Manufacturing Systems , 5 , 15 – 25 .
   Google Scholar
• LAGEWEG , B. J. , LENSTRA , J. K. , RINNOOY KAN , A. H. G. , 1977 , Job-shop scheduling by implicit enumeration . Managment Science , 24 , 441 – 450 .
   Web of Science ®Google Scholar
• LENSTRA , J. K. , RINNOOY KAN , A. H. G. and BRUCKER , P. , 1977 , Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 , 343 – 362 .
   Google Scholar
• MUTH , J. F. , THOMPSON G. L. , (eds) 1963 , Industrial Scheduling ( Englewood Cliffs , NJ Prentice-Hall ).
   Google Scholar
• SINGH , M. G. , 1978 Systems Decomposition, Optimisation and Control ( New York Pergamon Press ).
   Google Scholar
• SUND D., 1983 , Dynamic Job Shop Scheduling An Integrated Approach . PhD thesis , Dept. of IE, SUNY at Buffalo .
   Google Scholar
• VAN LAARHOVEN. P. J. M., AARTS , E. H. L. and LENSTRA , J. K. , 1992 , Job shop scheduling by simulated annealing . Operations Research , 8 , 487 – 503 .
   Google Scholar
• WISMER . D. A. , ed., 1970 , Optimization Methods for Large-Scale Systems—With Application ( New York McGraw-Hill ).
   Google Scholar
• ‡To whom correspondence should be addressed.
   Google Scholar