Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds

International Journal of Production Research

Volumn 44, Issue 4, 2006, Pages 715-728

  Choi, Byung Cheon ^a   Yoon, Suk Hun ^b   Chung, Sung Jin ^a  

^a Seoul National University   (South Korea)

^b Soongsil University   (South Korea)

Author keywords

Machine speed; NP complete; Proportionate flow shop; Weighted shortest processing time; Worst case performance ratio

Indexed keywords

ASSEMBLY MACHINES; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; SPEED;

MACHINE SPEED; NP-COMPLETE; PROPORTIONAL FLOW SHOP;

JOB ANALYSIS;

EID: 30844462555     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500268780     Document Type: Article

References (17)

1. Baker, K.R., Elements of Sequencing and Scheduling, 1995 (Kenneth R. Baker: Hanover, NH).
2. Croce, F.D., Generalized pairwise interchanges and machine scheduling. Eur. J. Oper, Res., 1995, 83, 310-319.
3. Garey, M.R. and Johnson, D.S., Computers and Intractability-A Guide to the Thoery of NP-completeness, 1979 (Freeman: San Francisco, CA).
4. Hall, N.G. and Postner, M.E., Generating experimental data for computational testing with machine scheduling applications. Op. Res., 2001, 49, 854-865.
5. Hoogeveen, J.A. and Kawaguchi, T., Minimizing total completion time in a two-machine flowsop: analysis of special cases. Math. Oper. Res., 1999, 24, 887-910.
6. Hou, S. and Hoogeveen, H., The three-machine proportionate flow shop problem with unequal machine speeds. Oper. Res. Lett., 2003, 31, 225-231.
7. Morton, T.E. and Pentico, D.W., Heuristic Scheduling Systems with Applications to Production Systems and Project Management, 1993 (Wiley: New York).
8. Ow, P.S., Focused scheduling in proportionate flow shops. Manag. Sci., 1985, 31, 851-869.
9. Panwalkar, S.S. and Kahn, A.W., An ordered flow shop sequencing problem with mean completion time criterion. Int. J. Prod. Res., 1976, 14, 631-635.
10. Pinedo, M., Scheduling: Theory, Algorithms and Systems, 1995 (Prentice Hall: Englewood Cliffs, NJ).
11. Schuurman, P. and Woeginger, G.J., Polynomial time approximation algorithms for machine scheduling: ten open problems. J. Schedul., 1999, 2, 203-213.
12. Sedgewick, R., Algorithms in C, 1990 (Addison-Wesley: Reading, MA).
13. Shakhlevich, N., Hoogeveen, H. and Pinedo, M., Minimizing total weighted completion time in a proportionate flow shop. J. Schedul., 1998, 1, 157-168.
14. Smith, M.L., Panwalkar, S.S. and Dudek, R.A., Flowshop sequencing problem with ordered processing time matrices. Manag. Sci., 1975, 21, 544-549.
15. Smith, M.L., Panwalkar, S.S. and Dudek, R.A., Flowshop sequencing problem with ordered processing time matrices: a general case. Nav. Res. Log. Q., 1976, 23, 481-486.
16. Smutnicki, C., Some results of the worst-case analysis for flow shop scheduling. Eur. J. Oper. Res., 1998, 109, 66-87.
17. Tanaev, V.S., Sotskov, Y.N. and Strusevich, V.A., Scheduling Theory, Multi-Stage Systems, 1994 (Kluwer: Boston, MA).