Minimizing total completion time in a two-machine flowshop: Analysis of special cases

Mathematics of Operations Research

Volumn 24, Issue 4, 1999, Pages 887-910

  Hoogeveen, J A ^a   Kawaguchi, T ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b OITA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; POLYNOMIALS;

TWO-MACHINE FLOWSHOP;

OPERATIONS RESEARCH;

EID: 0033311145     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.4.887     Document Type: Article

References (16)

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