FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors

References

• Arthanary , T. S. and Ramaswamy , K. G. 1971 . An Extension of the Two Machine Sequencing Problem . Opsearch , 8 : 10 – 22 .
   Google Scholar
• Brah , S. A. 1988 . Scheduling in a Flow Shop with Multiple Processors , Houston , TX : University of Houston . unpublished Ph.D. dissertation
   Google Scholar
• Brah , S. A. and Hunsucker , J. L. 1991 . Branch and Bound Algorithm for the Flow Shop with Multiple Processors . European Journal of Operational Research , 51 : 88 – 99 .
   Web of Science ®Google Scholar
• Brah , S. A. , Santos , D. L. and Hunsucker , J. L. Heuristic Programming Study of a Flow Shop with Multiple Processors Scheduling . ORSA/TIMS Joint National meeting in New York City . paper presented at the
   Google Scholar
• Campbell , H. G. , Dudek , R. A. and Smith , M. L. 1970 . A Heuristic Algorithm for the n-job, m-machine Sequencing Problem . Management Science , 16 : B630 – B637 .
   Web of Science ®Google Scholar
• Dannenbring , D. G. 1977 . An Evaluation of Flow Shop Sequencing Heuristics . Management Science , 23 : 1174 – 1182 .
   Web of Science ®Google Scholar
• Deal , D. E. and Hunsucker , J. L. 1991 . The Two-Stage Flowshop Scheduling Problem with m Machines at Each Stage . Journal of Information and Optimization Sciences , 12 : 407 – 417 .
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco : Freeman Press .
   Google Scholar
• Gupta , J. N. D. 1988 . Two-Stage, Hybrid Flowshop Scheduling Problem . Journal of the Operational Research Society , 39 : 359 – 364 .
   Web of Science ®Google Scholar
• Gupta , J. N. D. and Tunc , E. A. 1991 . Schedules for a Two-Stage Hybrid Flowshop with Parallel Machines at the Second Stage . International Journal of Production Research , 29 : 1489 – 1502 .
   Web of Science ®Google Scholar
• Hallquist , S. 1992 . Scheduling in a Two-Stage Hybrid Flow Shop with Finite Intermediate Storage , Houston , TX : University of Houston . unpublished Master’s thesis
   Google Scholar
• Hunsucker , J. L. and Shah , J. R. 1992 . Performance of Priority Rules in a Due Date Flow Shop . OMEGA, International Journal of Management Science , 20 : 73 – 89 .
   Web of Science ®Google Scholar
• Hunsucker , J. L. and Shah , J. R. 1994 . Comparative Performance Analysis of Priority Rules in a Constrained Flow Shop with Multiple Processors Environment . European Journal of Operational Research , 72 : 102 – 114 .
   Web of Science ®Google Scholar
• Nawaz , M. , Enscore , E. E. and Ham , I. 1983 . A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem . OMEGA, International Journal of Management Science , 11 : 91 – 95 .
   Web of Science ®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 . Operations Research Quarterly , 16 : 101 – 107 .
   Google Scholar
• Salvador , M. S. 1973 . “ A Solution to a Special Case of Flow Shop Scheduling Problems ” . In Symposium of the Theory of Scheduling and Applications , Edited by: Elmaghraby , S. E. New York : Springer-Verlag . in
   Google Scholar
• Santos , D. L. , Hunsucker , J. L. and Deal , D. E. Global Lower Bounds for Flow Shops with Multiple Processors . European Journal of Operational Research , to appear in
   Web of Science ®Google Scholar
• Wittrock , R. J. 1988 . An Adaptable Scheduling Algorithm for Flexible Flow Lines . Operations Research , 36 : 445 – 453 .
   Web of Science ®Google Scholar