Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

References

• BRUKER , P. 1981 , Minimizing maximum lateness in a two machine unit-time job shop . Computing , 27 , 367 – 370 .
   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 , B630–B637 .
   Web of Science ®Google Scholar
• CHENG , T. C. E. and SIN , C. C. S. 1990 , A state of art review of parallel machine scheduling research . European Journal of Operational Research , 47 , 271 – 292 .
   Web of Science ®Google Scholar
• DOGRAMACI , A. and SURKIS , J. 1979 , Evaluation of a heuristic for scheduling independent jobs on parallel identical processors . Management Science 25 , 1208 – 1216 .
   Web of Science ®Google Scholar
• FRENCH , S. 1982 , Sequencing and scheduling An introduction to the mathematics of the job-shop ( Chichester , UK Horwood ).
   Google Scholar
• GRABOWSKI , J. , SKUBALSKA , E. SMUTNICKI 1983 , On flowshop scheduling with release and due dates to minimize maximum lateness . Journal of the Operations Research Society , 34 , 615 – 620 .
   Web of Science ®Google Scholar
• GRABOWSKI , J. 1980 , On two machine scheduling with release and due dates to minimize maximum lateness . Opsearch , 17 , 133 – 154 .
   Google Scholar
• GUINET , A. , SOLOMON , M. M. , KEDIA , P. and DUSSAUCHOY , A. 1996 , A Computational Study of Heuristics for Two-Stage Flexible Flowshops . International Journal of Production Research , ( In press ).
   Web of Science ®Google Scholar
• GUINET , A. 1991 , Textile Production Systems a Succession of Non-Identical Parallel Processor Shops . Journal of the Operations Research Society , 42 , 655 – 671 .
   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
• GUPTA , J. N. D. 1988 , Tow stage hybrid flowshop scheduling problem . Journal of the Operations Research Society , 39 , 359 – 364 .
   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
• JACKSON , J. R. 1955 , Scheduling a production line to minimize maximum tardiness . Research Report 43 , University of California , Los Angeles .
   Google Scholar
• JOHNSON , S. M. 1954 , Optimal two and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 , 61 – 68 .
   Google Scholar
• LAWLER , E. L. , LUB , M. G. and VAZIRANI , V. V. 1982 , Scheduling open shops with parallel machines . Operations Research Letters 1 , 161 – 164 .
   Google Scholar
• LAWLER , E. L. and LABETOULLE , J. 1978 , On preemptive scheduling of unrelated machines . Journal of Associated Computing Machinery , 25 , 612 – 619 .
   Web of Science ®Google Scholar
• LANGSTON , M. A. 1987 . Interstage transportation planning in the deterministic flow-shop environment . Operations Research , 35 , 556 – 564 .
   Web of Science ®Google Scholar
• LEE , C. Y. and VAIRAKTARAKIS , G. L. 1994 , Minimizing makespan in hybrid flowshops . Operations Research Letters , 16 , 149 – 158 .
   Web of Science ®Google Scholar
• LEISTEN , R. 1990 , Flowshop sequencing problems with limited buffer storage . International Journal of Production Research , 28 , 2085 – 2100 .
   Web of Science ®Google Scholar
• LIOU , J. and SMITH , M. L. 1992 , Scheduling flowshop with limited in-process wait . Research report , Texas Technology University , Lubbock .
   Google Scholar
• MACCARTHY , B. L. and LIU , J. 1993 , Addressing the gap in scheduling research a review of optimization and heuristic methods in production scheduling . International Journal of Production Research , 31 , 59 – 79 .
   Web of Science ®Google Scholar
• NARASIMHAN , S. L. and MANGIAMELI , P. M. 1987 , A comparison of sequencing rules for a two-stage hybrid flow shop . Decision Sciences , 18 , 250 – 265 .
   Web of Science ®Google Scholar
• NARASIMHAN , S. L. and PANWALKAR , S. S. 1984 , Scheduling in a two-stage manufacturing process . International Journal of Production Research , 22 , 555 – 564 .
   Web of Science ®Google Scholar
• NAUGHTON , R. M. 1959 , Scheduling with deadlines and loss functions . Management Science , 6 , 1 – 12 .
   Web of Science ®Google Scholar
• NAWAZ , M. , ENSCORE , E. and HAM , I. 1983 , A heuristic algorithm for the m machine n job flowshop sequencing problem . Omega , 11 , 91 – 95 .
   Web of Science ®Google Scholar
• PARK , Y. P. , PEGDEN , C. and ENSCORE , E. E. 1984 , A survey and evaluation of static flowshop scheduling heuristics . International Journal of Production Research , 22 , 127 – 141 .
   Web of Science ®Google Scholar
• PROUST , C. 1992 , Using Johnson's algorithm for solving flowshop problems . Proceedings of the Summer School on Scheduling , INRIA, Bonnas ( France ), pp. 297 – 342 .
   Google Scholar
• Rajendran , C. 1994 , A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria . International Journal of Production Research , 32 , 2541 – 2558 .
   Web of Science ®Google Scholar
• SRISKANDARAJAH , C. 1993 , Performance of scheduling algorithms for no-wait flowshops with parallel machines. , European Journal of Operational Research , 70 , 365 – 378 .
   Web of Science ®Google Scholar
• SRISKANDARAJAH , C. 1989 , Production scheduling complexity and approximate algorithms. GERAD Research report, University of Montreal .
   Google Scholar
• SRISKANDARAJAH , C. and SETHI , S. P. 1989 , Scheduling algorithms for flexible flow shops worst and average performance . European Journal of Operational Research 43 , 143 – 160 .
   Web of Science ®Google Scholar
• TAILLARD , E. 1990 , Some efficient heuristic methods for the flow shop sequencing problem . European Journal of Operational Research , 47 , 65 – 74 .
   Web of Science ®Google Scholar
• TOWNSEND , D. W. 1977 , Sequencing n jobs on m machines to minimize tardiness a branch and bound solution . Management Science , 23 , 1016 – 1019 .
   Web of Science ®Google Scholar