Minimizing Mean Completion Time for Special Flowshop Problems

References

• Adiri , I. and Pohoryles , D. 1982 . Flowshop/No ldle or No Wait scheduling to minimize the sum of Completion Time . Naval Research Logistics , 29 : 495 – 504 .
   Google Scholar
• Baker , K.R. 1974 . “ Introduction to sequencing and Scheduling ” . John Wiley and Sons .
   Google Scholar
• Bansal , S.P. 1997 . Minimizing the sum of completion of n jobs over m machines in a Flowshop—A Branch and Bound Approach . AIIE Transactions , 9 : 306 – 311 .
   Google Scholar
• Bansal , S.P. and Bagga , P.C. 1977 . Minimizing Waiting Costs of n 2 Flowshop Problem . SCIMA , 6 : 57 – 68 .
   Google Scholar
• Brown , A.P.G. and Lomnicki , Z.A. 1966 . Some Applications of the Branch and Bound Algorithm to the Machine Scheduling Problem . Opnl. Res , 17 : 173 – 186 .
   Google Scholar
• Conway , R.W. , Maxell , W.L. and Miller , L.W. 1967 . “ Theory of Scheduling ” . Massachusetts : Addison Wesley . Reading
   Google Scholar
• Gupta J. N. D. M–stage Flowshop Scheduling by Branch and Bound Opsearch 1970 7 37
   Google Scholar
• Gupta , J.N.D. 1975 . Optimal Schedules for Special Structure Flowshops . Naval Research Logistics , 22 : 255 – 269 .
   Google Scholar
• Ho , J.C. and Gupta , J.N.D. 1995 . Flowshop Schedules with Dominant Machines . Computers and Operations Research , 22 : 237 – 246 .
   Google Scholar
• Ignall , E. and Schrage , L. 1965 . Applications of the Branch and Bound Technique to some Flowshop Scheduling Problems . Opns. Res , 13 : 400 – 412 .
   Web of Science ®Google Scholar
• Johnson , S.M. 1954 . Optimal Two and Three Stage production Schedules with set up included . Naval Research Logistics , 1 : 61 – 78 .
   Google Scholar
• Lawler , E.L. and Wood , D.E. 1966 . Branch and Bound methods: A Survey . Opnl. Res , 14 : 699 – 719 .
   Web of Science ®Google Scholar
• Mc.Mahon , G.B. and Burton , P.G. 1967 . Flowshop Scheduling with Branch and Bound Method . Opns. Res , 15 : 473 – 481 .
   Google Scholar
• Monma , C.L. and Rinnooy Kan , A.H.G. 1967 . A Concise survey of Efficiently Solvable cases of the Permutation Flowshop problem . R.A.I.R.O. Rech Opl. Ops. Res , 17 : 105 – 119 .
   Google Scholar
• Morton , T.E. and Pentico , D.W. 1993 . “ Heuristic scheduling systems ” . New York : John Wiley and Sons .
   Google Scholar
• Panwalker , S.S. and Khan , A.W. 1975 . An improved Branch and Bound Procedure for the n × m Flowshop Problems . Naval Research Logistics , 22 : 787 – 790 .
   Google Scholar
• Panwalker , S.S. and Khan , A.W. 1976 . An ordered Flowshop Sequencing Problem with Mean Completion Time Criterion . Int. J. Prod. Res , 14 : 631 – 635 .
   Google Scholar
• Szwarc , W. 1977 . Special Cases of the Flowshop problem . Naval Research Logistics , 24 : 483 – 492 .
   Google Scholar
• Szwarc , W. 1978 . Permutation Flowahop Theory Revisited . Naval Research Logistics , 25 ( 3 ) : 557 – 570 .
   Web of Science ®Google Scholar
• Szwarc , W. 1983 . The Flowshop problem with mean completion Time Criterion . AIIE Transactions , 15 ( 3 ) : 172 – 176 .
   Google Scholar