An extension of Palmer's heuristic for the flow shop scheduling problem

References

• BAKER , K. R. , 1965 , Introduction to Sequencing and Scheduling ( New York : John Wiley ).
   Google Scholar
• BONNEY , M. C. , and GRUNDY , S. W. , 1976 , Solutions to the constrained flow shop sequencing problem . Operational Research Quarterly , 27 , 869 .
   Google Scholar
• CAMBELL , H. G. , DUDEK , R. A. , and SMITH , H. L. , 1970 , A heuristic algorithm for the n job m-machine sequencing problem . Management Science, B , 10 , 630 .
   Google Scholar
• DANNENBRING , D. G. , 1977 , An evaluation of flow shop sequencing heuristics . Management Science , 23 , 1174 .
   Web of Science ®Google Scholar
• GUPTA , J. N. D. , 1971 , The generalized n-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 . Naval Research Logistics Quarterly , 1 , 61 .
   Google Scholar
• KING , J. R. , and SPACHIS , A. S. , 1980 , Heuristics for flow shop scheduling . International Journal of Production Research , 18 , 345 .
   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 .
   Google Scholar
• PAGE , E. S. , 1961 , An approach to the scheduling of jobs on machines . Journal of the Royal Statistical Society , 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 . Operational Research Quarterly , 16 , 101 .
   Google Scholar