Heuristics for flow-shop scheduling

References

• BESTWICK , P. F. ,and HASTiNGS , N. A. J. 1976 , Anew bound for machine scheduling , Opl Res. Q. , 27 , 479 .
   Google Scholar
• BONNEY , M. C. , and GRUNDY , S. W. , 1976 , Solutions to the constrained fiowshop sequencing problem , Opl Res. Q. , 27 , 869 .
   Google Scholar
• BROOKS , G. H. , and WHITE , C. R. , 1965 , An algorithm for finding optimal as near optimal solutions to the production scheduling problem , J. lnd. Engng , 16 , 34 .
   Web of Science ®Google Scholar
• BROWN , A. P. G. , and LOMNICKI , Z. A. , 1966 , Some applications of the branch and bound algorithm to the machine scheduling problem , Opt Res. Q. , 17 , 173 .
   Google Scholar
• CAMPHELL , H. G. , DUDEK , R. A. , and SMITH , M. L. , 1970 , A heuristic algorithm for the n-job, m-machine sequencing problem , Mgml Set. B , 10 , 630 .
   Google Scholar
• CONWAV , R. W. , and MAXWELL , W. L. , 1962 , Network despatching by the shortest operation discipline , Ops Res. , 10 , 57 .
   Web of Science ®Google Scholar
• COOK , S. A. , 1971 , The complexity of theorem proving procedures , Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing , pp. 151 - 158 .
   Google Scholar
• DANNENBRING , D. G. , 1977 , An evaluation of flow shop sequencing heuristics , MgmtSci. , 23 , 1174 .
   Web of Science ®Google Scholar
• GUPTA , J. N. D. , 1971 , The generalized m-job, m-machine scheduling problem , Opsearch , 8 , 173 .
   Google Scholar
• JOHNSON , S. M. , 1954 , Optimal two and three-stage production schedules with set up times included , Nav. Res, Logist. Q. , 1 , 61 .
   Google Scholar
• KARP , R. M. , 1972 , Reducability among combinatorial problems in Complexity of Computer Operations edited by R. E. Miller and J. W. Thatcher ( New York Plenum Press ); 1975, On the computational complexity of combinatorial problems, Networks, 5, 45 .
   Google Scholar
• KING , J. R. , 1979 , Scheduling and the problem of computational complexity . Omega , 7 , 233 .
   Web of Science ®Google Scholar
• LENSTRA , J. K. , RINNOOY KAN , A. H. G. , and BRUUKBR , P. , 1977 , Complexity of machine scheduling problems , Ann. Discrete Math. , 1 , 343 .
   Google Scholar
• LITTLE , J. D. G. , MURTY , K. G. , SWEENEY , D. W. , and KAREL , G. , 1963 , An algorithm for the travelling salesman problem , Ops Res. , 11 , 972 .
   Web of Science ®Google Scholar
• LOMNICKI , Z. A. , 1965 , A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem , Ops Res. Q. , 16 , 89 .
   Google Scholar
• MCMAHON , G. B. , and BURTON , P. G. , 1967 , Flow-shop scheduling with the branch and bound method , Ops Res. , 15 , 473 .
   Web of Science ®Google Scholar
• PAGE , E. S. , 1961 , An approach to the scheduling of jobs on machines . Jl R. statist. Soc. , 323 - 484 .
   Google Scholar
• PALMER , D. S. , 1965 , Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum , Opl Res. Q. , 16 , 101 .
   Google Scholar
• SPACHIS , A. S. , 1978 , Routines for heuristic flow-shop scheduling with no-job-passing and/or no-waiting (Computer codes in Fortran IV) , Department of Management Science, Imperial College London ; 1979, Job-shop scheduling with approximate methods. Unpublished Ph.D. thesis, Department of Management Science, Imperial College, London .
   Google Scholar
• WISMER , D. A. , 1972 , Solution of the flow-shop scheduling problem with no intermediate queues , Ops Res. , 20 , 689 .
   Web of Science ®Google Scholar