Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics

International Journal of Production Research

Volumn 50, Issue 24, 2012, Pages 7428-7446

  Rabiee, M ^a   Zandieh, M ^b   Jafarian, A ^c  

^a K N TOOSI UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHAHID BEHESHTI UNIVERSITY   (Iran)

^c ALLAMEH TABATABA'I UNIVERSITY   (Iran)

Author keywords

desirability; imperialist competitive algorithm; no wait two machine flow shop; probable rework; response surface methodology; sequence dependent setup times

Indexed keywords

COMPETITIVE ALGORITHMS; DESIRABILITY; FLOW-SHOPS; PROBABLE REWORK; RESPONSE SURFACE METHODOLOGY; SEQUENCE-DEPENDENT SETUP TIME;

HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; SCHEDULING; SIMULATED ANNEALING; SURFACE PROPERTIES;

GENETIC ALGORITHMS;

EID: 84868686645     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.652747     Document Type: Article

References (32)

1. Aldowaisan, T. 2001. A new heuristic and dominance relations for no-wait flowshops with setups. Computer and Operation Research, 28 (6): 563-584.
2. Aldowaisan, T, and, Allahverdi, A. 1998. Total flowtime in no-wait flow shops with separated setup times. Computer and Operation Research, 25 (9): 757-765.
3. Aldowaisan, T, and, Allahverdi, A. 2004. New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega, 32 (5): 345-352. (Pubitemid 38726375)
4. Almada-Lobo, B, and, James, RJW. 2010. Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal of Production Research, 48 (3): 861-878.
5. Atashpaz-Gargari, and, Lucas, EC. 2007. Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialist competitive. In: IEEE Congress on Evolutionary Computation, Singapore
6. Bagher, M, Zandieh, M, and, Farsijani, H. 2011. Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm. International Journal of Advanced Manufacturing Technology, 54 (1-4): 271-285.
7. Brucker, P, Knust, S, and, Wang, G. 2005. Complexity result for flow-shop problems with a single server. European Journal of Operational Research, 165 (2): 398-407. (Pubitemid 40206370)
8. Cheng, TCE, Wang, G, and, Sriskandarajah, C. 1999. One-operator-two- machine flowshop scheduling with setup and dismounting times. Computers and Operations Research, 26 (7): 715-30. (Pubitemid 29346448)
9. Chihaoui, FB. 2011. No-wait scheduling of a two-machine flow-shop to minimise the MCT under non-availability constraints and different release dates. International Journal of Production Research, 49 (21): 6273-6286.
10. Derringer, G, and, Suich, R. 1980. Simultaneous optimization of several response variables. Journal of Quality Technology, 12 (4): 214-219.
11. Flapper, SDP, and, Teunter, RH. 2004. Logistic planning of rework with deteriorating work-in-process. International Journal of Production Economics, 88 (1): 51-59.
12. Forouharfard, S, and, Zandieh, M. 2010. An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. International Journal of Advanced Manufacturing Technology, 51 (9): 1179-1193.
13. Gilmore, PC, and, Gomory, RE. 1964. Sequencing a one-state variable machine: a solvable case of the travelling salesman problem. Operations Research, 12 (3): 655-679.
14. Goyal, SK, and, Sriskandarajah, C. 1988. No-wait shop scheduling: computational complexity and approximate algorithms. Operations Research, 25 (4): 220-244.
15. Gupta, JND, Strusevich, VA, and, Zwaneveld, CM. 1997. Two-stage no-wait scheduling models with setup and removal times separated. Computer and Operation Research, 24 (11): 1025-1031.
16. Hall, N, and, Sriskandarajah, C. 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44 (3): 510-525. (Pubitemid 126669516)
17. Hunsucker, JL, and, Shah, JR. 1994. Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment. European Journal of Operational Research, 72 (1): 102-114.
18. Kurz, ME, and, Askin, RG. 2004. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, 159 (1): 66-82.
19. Li, X, Wang, Q, and, Wu, C. 2008. Heuristic for no-wait flow shops with makespan minimization. International Journal of Production Research, 46 (9): 2519-30. (Pubitemid 351394267)
20. Liu, Z. 2003. A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage. Tsinghua Science and Technology, 8 (1): 43-48.
21. Myers, RH, and, Montgomery, DC. 2002. Response surface methodology, New York: Wiley.
22. Naderi, B, Zandieh, M, and, Shirazi, MAHA. 2009. Modelling and scheduling a case of flexible flowshops: total weighted tardiness minimization. Computers and Industrial Engineering, 57 (4): 1258-1267.
23. Neter, J. 1996. Applied linear statistical models, 4th ed, New York: WCB McGraw-Hill.
24. Pinedo, M. 1995. Scheduling theory, algorithms, and systems, Englewood Cliffs, NJ: Prentice-Hall.
25. Rajendran, C, and, Chaudhuri, D. 1990. Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics, 37 (5): 695-705. (Pubitemid 21648558)
26. Ruiz, R, and, Allahverdi, A. 2009. New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness. International Journal of Production Research, 47 (20): 5717-5738.
27. Shafaei, R, Rabiee, M, and, Mirzaeyan, M. 2011. An adapted neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop. International Journal of Computer Integrated Manufacturing, 24 (10): 888-899.
28. Shokrollahpour, E, Zandieh, M, and, Dorri, B. 2011. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research, 49 (11): 3087-3103.
29. Sidney, JB, Potts, CN, and, Sriskandarajah, C. 2000. A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letter, 26 (4): 165-173.
30. Su, LH, and, Lee, YY. 2008. The two-machine flow shop no-wait scheduling problem with a single server to minimize the total completion time. Computers and Operations Research, 35 (9): 2952-2963.
31. Vinod, V, and, Sridharan, R. 2009. Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times. International Journal of Production Research, 47 (6): 1425-1447.
32. Zandieh, M, and, Gholami, M. 2009. An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research, 47 (24): 6999-7027.