The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time

International Journal of Advanced Manufacturing Technology

Volumn 37, Issue 1-2, 2008, Pages 166-177

  Allahverdi, Ali ^a   Al Anzi, Fawaz S ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Assembly flowshop; Bicriteria; Heuristic; Makespan; Mean competition time

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; SIMULATED ANNEALING; STATISTICAL METHODS;

ASSEMBLY FLOWSHOP; BICRITERIA; MAKESPAN; MEAN COMPETITION TIME;

SCHEDULING;

EID: 43249106280     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-0950-y     Document Type: Article

References (42)

1. Abbass HA (2002) The self-adaptive pareto differential evolution algorithm. In: Proceedings of the 4th IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, May 2002, pp 831-836
2. Al-Anzi FS, Allahverdi A (2006) A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. Eur J Oper Res (in press)
3. Al-Anzi FS, Allahverdi A (2006) A hybrid tabu search heuristic for the two-stage assembly scheduling problem. Int J Oper Res 3(2):109-119
4. Al-Anzi FS, Allahverdi A (2004) A hybrid simulated annealing heuristic for multimedia object requests scheduling problem. Int J Comput Appl 26(4):207-212
5. Allahverdi A (2003) The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur J Oper Res 147(2):373-396
6. Allahverdi A, Al-Anzi FS (2006) Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. Int J Prod Res 44(22):4713-4735
7. Allahverdi A, Al-Anzi FS (2002) Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Comput Oper Res 29(8):971-994
8. Allahverdi A, Aldowaisan T (2002) No-wait flowshops with bicriteria of makespan and total completion time. J Oper Res Soc 53(9):1004-1015
9. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega Int J Manag Sci 27(2):219-239
10. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2007) A survey of scheduling problems with setup times or costs. Eur J Oper Res (in press)
11. Babu BV, Jehan MML (2003) Differential evolution for multi-objective optimization. In: Proceedings of the 5th IEEE Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, December 2003, vol 4, pp 2696-2703
12. Blum C (2005) Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565-1591
13. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Varela FJ, Bourgine P (eds) Proceedings of the 1st European Conference on Artificial Life, Paris, France, December 1991
14. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53-66
15. Gonzalez T, Sahni S (1978) Flow shop and job shop schedules. Oper Res 26(1):36-52
16. Gutjahr WJ, Rauner MS (2007) An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput Oper Res 34(3):642-666
17. Haouari M, Daouas T (1999) Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Rech Opér 33(4):439-445
18. Ho JC, Chang Y-L (1991) A new heuristic for the n-job, m-machine flow-shop problem. Eur J Oper Res 52(2):194-202
19. Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103(3):547-556
20. Lampinen J, Zelinka I (2000) On stagnation of the differential evolution algorithm. In: Proceedings of the 6th International MENDEL Conference on Soft Computing, Brno, Czech Republic, June 2000, pp 76-83
21. Lee C-E, Chou F-D (1998) A two-machine flowshop scheduling heuristic with bicriteria objective. Int J Ind Eng 5(2):128-139
22. Lee C-Y, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag Sci 39(5):616-625
23. Liao CJ, Juan HC (2006) An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput Oper Res (in press)
24. Liu J, Lampinen J (2002) A fuzzy adaptive differential evolution algorithm. In: Proceedings of the 2002 IEEE International Region 10 Conference onComputers, Communications, Control and Power Engineering (TENCON 2002), Beijing, China, October 2002, pp 606-611
25. Low C (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput Oper Res 32(8):2013-2025
26. Mika M, Waligóra G, Weglarz J (2005) Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur J Oper Res 164(3):639-668
27. Nagar A, Haddock J, Heragu SS (1996) A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem. Ann Oper Res 63(3):397-414
28. Omran MGH, Salman A, Engelbrecht AP (2005) Self-adaptive differential evolution. In: Proceedings of the International Conference on Computational Intelligence and Security (CIS 2005), Xi'an, China, December 2005, pp 192-199
29. Onwubolu G, Davendra D (2006) Scheduling flow shops using differential evolution algorithm. Eur J Oper Res 171(2):674-692
30. Pan C-H, Chen J-S (1997) Scheduling alternative operations in two-machine flow-shops. J Oper Res Soc 48(5):533-540
31. Potts CN, Sevast'janov SV, Strusevich VA, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. Oper Res 43(2):346-355
32. Rajendran C (1995) Heuristics for scheduling in flowshop with multiple objectives. Eur J Oper Res 82(3):540-555
33. Sadegheih A (2006) Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Appl Math Model 30(2):147-154
34. Sayin S, Karabati S (1999) A bicriteria approach to the two-machine flow shop scheduling problem. Eur J Oper Res 113(2):435-449
35. Sivrikaya-Serifoglu F, Ulusoy G (1998) A bicriteria two-machine permutation flowshop problem. Eur J Oper Res 107(2):414-430
36. Storn R, Price K (1995) Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical report TR-95-012, International Computer Science Institute, Berkeley, California
37. Sun X, Morizawa K, Nagasawa H (2003) Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. Eur J Oper Res 146(3):498-516
38. Tozkapan A, Kirca O, Chung C-S (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 30(2):309-320
39. Wang MY, Sethi SP, Van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45(5):702-712
40. Yeh W-C (1999) A new branch-and-bound approach for the n/2/flowshop/αF+βC[max] flowshop scheduling problem. Comput Oper Res 26(13):1293-1310
41. Yeh W-C (2001) An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem. J Manuf Syst 20(2):113-123
42. Yeh W-C, Allahverdi A (2004) A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime. Int Trans Oper Res 11(3):341-359