The tricriteria flowshop scheduling problem

International Journal of Advanced Manufacturing Technology

Volumn 36, Issue 11-12, 2008, Pages 1210-1220

  Eren, Tamer ^a   Güner, Ertan ^b  

^a KIRIKKALE UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Flowshop scheduling; Heuristic methods; Integer programming; Tricriteria

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATIONAL ANALYSIS; FLOWSHOP SCHEDULING; TARDINESS CRITERION; TRICRITERIA;

SCHEDULING;

EID: 43449107101     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-0931-1     Document Type: Article

References (34)

1. Allahverdi A (1995) Two-stage production scheduling with separated set-up times and stochastic breakdowns. J Oper Res Soc 46:896-904
2. Allahverdi A (1997) Scheduling in stochastic flowshops with independent setup, processing and removal times. Comput Oper Res 24(10):955-960
3. Allahverdi A (2000) Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Comput Oper Res 27(2):111-127
4. Allahverdi A (2001) The tricriteria two-machine flowshop scheduling problem. Int Trans Oper Res 8:403-425
5. Allahverdi A, Mittenthal J (1998) Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. Int Trans Oper Res 5(4):317-324
6. Chakravarthy K, Rajendran C (1999) A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod Plan Control 10(7):707-714
7. Chou FD, Lee CE (1999) Two-machine flowshop scheduling with bicriteria problem. Comput Ind Eng 36:549-564
8. Daniels RL, Chambers RJ (1990) Multiobjective flow-shop scheduling. Nav Res Logist 37:981-995
9. Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. Eur J Oper Res 90:227-237
10. Eren T (2004) The solution approaches for multicriteria flowshop scheduling problems. PhD Thesis, University of Gazi, Turkey
11. Eren T, Güner E (2004) A literature survey for multicriteria flowshop scheduling problems. J Eng Sci Pamukkale Univ Eng Col (in Turkish) 10:19-30
12. Fisher ML (1976) A dual algorithm for the one-machine scheduling problem. Math Program 11:229-251
13. Garey MR, Johnson DS, Sethi RR (1976) The complexity of flowshop and jobshop scheduling. Oper Res 1:117-129
14. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 5:533-549
15. Gonzalez T, Sahni S (1978) Flowshop and jobshop schedules: complexity and approximations. Oper Res 26(1):36-52
16. Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist 1:61-68
17. Kim Y (1993) A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Comput Oper Res 20:391-401
18. Koulamas C (1998) A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem. Comput Oper Res 25:83-89
19. Lee C-E, Chou F-D (1998) A two-machine flowshop scheduling heuristic with bicriteria objective. Int J Ind Eng 5(2):128-139
20. Lee W-C, Wu C-C (2001) Minimizing the total flow time and the tardiness in a two-machine flow shop. Int J Syst Sci 32:365-373
21. Lenstra JK, Kan Rinnooy AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 4:281-300
22. Liao C-J, Yu W-C, Joe C-B (1997) Bicriterion scheduling in the two-machine flowshop. J Oper Res Soc 48:929-935
23. Lindo Systems Inc. (1997) Hyper LINDO/PC Release 6.01. Chicago, USA
24. Nagar A, Heragu SS, Haddock J (1995) A branch-and-bound approach for a two-machine flowshop scheduling problem. J Oper Res Soc 46:721-734
25. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91-95
26. Pan JC-H, Fan ET (1997) Two-machine flow-shop scheduling to minimize total tardiness. Int J Syst Sci 28:405-414
27. Pan JC-H, Chen J-S, Chao CM (2002) Minimizing tardiness in a two-machine flow-shop. Comput Oper Res 29(7):869-885
28. Pinedo ML (1995) Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs, NJ, pp 1-6, pp 93-117
29. Sen T, Dileepan P, Gupta JND (1989) The two-machine flowshop scheduling problem with total tardiness. Comput Oper Res 16:333-340
30. Şerifoglu FS, Ulusoy G (1998) A bicriteria two-machine permutation flowshop problem. Eur J Oper Res 107:414-430
31. Sule DR (1982) Sequencing n jobs on two machines with setup, processing and removal times separated. Nav Res Logist Q 29:517-519
32. Van de Velde SL (1990) Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangean relaxation. Ann Oper Res 26:257-268
33. max flowshop scheduling problem. Comput Oper Res 26:1293-1310
34. Yoshida T, Hitomi K (1979) Optimal two-stages production scheduling with setup times separated. AIIE Trans 11:261-263