Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases

References

• Ahmadi R. H., Bagchi U. Improved lower bounds for minimizing the sun of completion times on n jobs over m machines in a flow shop. Eur. J. Oper. Res. (1990) 44:331–336Crossref, Google Scholar
• Conway R. W., Maxwell W. L., Miller L. W.Theory of Scheduling (1967) (Addison-Wesley, Reading, Massachusetts) Google Scholar
• Della Croce F., Narayan V., Tadei R. The two-machine total completion time flow shop problem. Eur. J. Oper. Res. (1996) 90:227–237Crossref, Google Scholar
• Garey M. R., Johnson D. S., Sethi R. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. (1976) 13:330–348Link, Google Scholar
• Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
• Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. (1979) 5:287–326Crossref, Google Scholar
• Gonzalez T., Sahni S. Flowshop and jobshop schedules: Complexity and approximation. Oper. Res. (1978) 26:36–52Link, Google Scholar
• Hoogeveen J. A., Van de Velde S. L. Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems. Math. Programming (1995) 70:173–190Crossref, Google Scholar
• Ignall E., Schrage L. Application of the branch and bound technique for some flow-shop scheduling problems. Oper. Res. (1965) 13:400–412Link, Google Scholar
• Kohler W. H., Steiglitz K. Exact, approximate and guaranteed accuracy algorithms for the flowshop problem n/2/F/F. J. Appl. Comput. Mach. (1975) 22:106–114Crossref, Google Scholar
• Rajendran C., Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flow-shop. Eur. J. Oper. Res. (1991a) 61:318–325Crossref, Google Scholar
• Chaudhuri D. A flowshop scheduling algorithm to minimize total flowtime. J. Oper. Res. Soc. Japan (1991b) 34:28–46Google Scholar
• Sarin S. C., Eybl D. The two-machine mean-flowtime flowshop problem and some special cases. (1978) (Los Angeles, CA). Talk at ORSA/TIMS, NovemberGoogle Scholar
• Smutnicki C.Minimizing mean flow time in the permutation flow shop. A worst-case study (1995) . Technical report PRE 10/95, Institute of Engineering Cybernetics, WroclawGoogle Scholar
• Sewarc W. The flow-shop problem with mean completion time criterion. IIE Trans. (1983) 15:172–176Crossref, Google Scholar
• Van de Velde S. L. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relation. Ann. Oper. Res. (1990) 26:257–268Google Scholar