AN EVALUATION OF THE CDS HEURISTIC IN FLOW SHOPS WITH MULTIPLE PROCESSORS

REFERENCES

• Brah , S. A. , Hunsucker , J. L. and Shah , J. 1991 . Mathematical Modeling of Scheduling problems . Journal of Information & Optimization Science , 12 ( 1 ) : 113 – 137 .
   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
• 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 ( 10 ) : B630 – B637 .
   Web of Science ®Google Scholar
• Dannenbring , David G. 1977 . An Evaluation of Flow Shop Sequencing Heuristics . Management Science , 23 ( 11 ) : 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 & Optimization Sciences , 12 : 407 – 417 .
   Google Scholar
• Deal , D. E. , Yang , T. and Hallquist , S. J. 1994 . Job scheduling in petrochemical production: two-stage processing with finite intermediate storage . Computers and Chemical Engineering , 18 : 333 – 344 .
   Web of Science ®Google Scholar
• French , S. 1982 . Sequencing and Scheduling: An Introduction to the Mathematics of Job-Shop New York : John Wiley & Sons .
   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
• Hunsucker , J. L. and Shah , J. R. 1992 . Performance of Priority Rules in a Due Date Flow Shop . Omega , 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
• Lee , David Z. L. 2000 . Zero Wait Flow Shop with Multiple Processors with Heuristic, Algorithm, and Mathematical Concepts University of Houston . Unpublished Ph.D. Dissertation
   Google Scholar
• Lee , C. Y. and Vairaktarakis , G. L. 1994 . Minimizing Makespan in Hybrid Flowshop . Operations Research Letters 16 , : 149 – 58 .
   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 . Opers Res. Q. , 16 : 101 – 107 .
   Google Scholar
• Santos , D. L. , Hunsucker , J. L. and Deal , D. E. 1995a . Global Lower Bounds for Flow Shops with Multiple Processors . European Journal of Operational Research , 80 : 112 – 120 .
   Web of Science ®Google Scholar
• Santos , D. L. , Hunsucker , J. L. and Deal , D. E. 1995 . FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors . Journal of Information and Optimization Sciences , 16 : 351 – 366 .
   Google Scholar
• Santos , D. L. , Hunsucker , J. L. and Deal , D. E. 1996 . An Evaluation of Sequencing Heuristics in Flow Shops with Multiple Processors . Computers and Engineering , 10 ( 4 ) : 681 – 691 .
   Google Scholar
• Santos , D. L. , Hunsucker , J. L. and Deal , D. E. 2001 . On Makespan Improvement in Flowshops with Multiple Processors . Production Planning and Control , 12 ( 3 ) : 283 – 295 .
   Web of Science ®Google Scholar
• Schellhase , J. C. 1996 . The Placement of an Additional Processor in a Flow Shop with Multiple Processor University of Houston . Unpublished Ph.D. Dissertation
   Google Scholar
• Thornton , H. W. 2000 . The Placement of Additional Storage in a Flow Shop with Multiple Processors and No Intermediate Storage University of Houston . Unpublished Ph.D. Dissertation
   Google Scholar
• Wang , W. 2001 . A Study of Mean Flow Time and Makespan in Flow Shops with Multiple Processors University of Houston . Unpublished Ph.D. Dissertation
   Google Scholar
• Weiss , Scott A. 1998 . A Bin Packing Approach to Scheduling Flow Shops with Multiple Processors University of Houston . Unpublished Ph.D. Dissertation
   Google Scholar