An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server

European Journal of Industrial Engineering

Volumn 5, Issue 2, 2011, Pages 111-131

  Samarghandi, Hamed ^a   ElMekkawy, Tarek Y ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Makespan; No wait; Separable setup; Single server; Two machine flow shop

Indexed keywords

TABU SEARCH;

MAKESPAN; NO WAIT; SEPARABLE SETUP; SINGLE SERVER; TWO MACHINE FLOW SHOP;

MACHINE SHOP PRACTICE;

EID: 79955418363     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2011.039869     Document Type: Article

References (47)

1. Akkan, C. and Karabati, S. (2004) 'The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm', European Journal of Operational Research, Vol. 159, pp.420-429.
2. Aldowaisan, T. (2001) 'A new heuristic and dominance relations for no-wait flowshops with setups', Computers & Operations Research, Vol. 28, pp.563-584.
3. Aldowaisan, T. and Allahverdi, A. (1998) 'Total flowtime in no-wait flowshops with separated setup times', Computers & Operations Research, Vol. 25, pp.757-765.
4. Aldowaisan, T. and Allahverdi, A. (2004) 'New heuristics for m-machine no-wait flowshop to minimize total completion time', Omega, pp.345-352. (Pubitemid 38726375)
5. Allahverdi, A., Gupta, J. and Aldowaisan, T. (1999) 'A review of scheduling research involving setup considerations', Omega, Vol. 27, pp.219-239.
6. Allahverdi, A., Ngb, C.T., Chengb, T.C.E. and Kovalyov, M.Y. (2008) 'A survey of scheduling problems with setup times or costs', European Journal of Operational Research, Vol. 187, pp.985-1032. (Pubitemid 350236619)
7. Behroozi, M. (2009) 'A meta-heuristic approach for a special class of job shop scheduling problem', Faculty of Industrial Engineering. Tehran, Iran, Sharif University of Technology, Master of Science.
8. Bent, R. and Hentenryck, P.V. (2001) 'A two stage hybrid local search for the vehicle routing problem with time windows', Technical Report, CS-01-06, Department of Computer Science, Brown University.
9. Bianco, L., Dell'Olmo, P. and Giordani, S. (1999) 'Flow shop no-wait scheduling with sequence dependent setup times and release dates', INFOR, Vol. 37, No. 1, pp.3-20.
10. Bonney, M. and Gundry, S. (1976) 'Solutions to the constrained flowshop sequencing problem', Operational Research Quarterly, Vol. 24, pp.869-883.
11. Brucker, P., Knust, S. and Wang, G. (2005) 'Complexity results for flow-shop problems with a single server', European Journal of Operational Research, Vol. 165, pp.398-407. (Pubitemid 40206370)
12. Cadambi, B. and Sathe, Y. (1993) 'Two-machine flowshop scheduling to minimize mean flow time', Operational Research Society of India, Vol. 30, pp.35-41.
13. Campbell, H., Dudek, R. and Smith, M. (1970) 'A heuristic algorithm for the n-job, m-machine sequencing problem', Management Science, Vol. 16, pp.630-637.
14. Chen, C., Neppalli, R. and Ajaber, N. (1996) 'Genetic algorithms applied to the continuous flow shop problem', Computers & Industrial Engineering, Vol. 30, pp.919-929. (Pubitemid 126375903)
15. Cheng, T., Gupta, J. and Wang, G. (2002) 'A review of flowshop scheduling research with setup times', Production and Operations Management, Vol. 9, pp.262-282.
16. Cheng, T.C.E., Wang, G. and Sriskandarajah, C. (1999) 'One-operator-two-machine flowshop scheduling with setup and dismounting times', Computers and Operations Research, Vol. 26, pp.715-730. (Pubitemid 29346448)
17. Dannenbring, D. (1977) 'An evaluation of flowshop sequencing heuristics', Management Science, Vol. 23, pp.1174-1182.
18. DellaCroce, F., Ghirardi, M. and Tadei, R. (2002) 'An improved branch-and-bound algorithm for the two machine total completion time flow shop problem', European Journal of Operational Research, Vol. 139, pp.293-301. (Pubitemid 34201240)
19. denBasten, M. and Stutzle, T. (2001) 'Neighborhoods revisited: Investigation into the effectiveness of variable neighborhood descent for scheduling', MIC 2001, Porto, pp.545-549.
20. Engels, C. and Manthey, B. (2009) 'Average-case approximation ratio of the 2-opt algorithm for the TSP', Operations Research Letters, Vol. 37, pp.83-84.
21. Gangadharan, R. and Rajedran, C. (1993) 'Heuristic algorithms for scheduling in no-wait &owshop', International Journal of Production Economics, Vol. 32, pp.285-290.
22. Garey, M., Johnson, D. and Sethi, R. (1976) 'The complexity of flowshop and jobshop scheduling', Mathematics of Operations Research, Vol. 1, pp.117-129.
23. Glass, C., Gupta, J. and Potts, C. (1999) 'Two-machine no-wait flow shop scheduling with missing operations', Mathematics of Operations Research, Vol. 24, No. 4, pp.911-0924.
24. Glass, C.A., Shafransky, Y.M. and Strusevich, V.A. (2000) 'Scheduling for parallel dedicated machines with a single server', Naval Research Logistics, Vol. 47, No. 4, pp.304-328.
25. Glover, F. (1986) 'Future paths for integer programming and links to artificial intelligence', Computers & Operations Research, Vol. 13, pp.533-549. (Pubitemid 17480188)
26. Goyal, S. and Sriskandarajah, C. (1988) 'No-wait shop scheduling: computational complexity and approximate algorithms', Opsearch, Vol. 25, pp.220-244.
27. Grabowski, J. and Pempera, J. (2005) 'Some local search algorithms for no-wait flow-shop problem with makespan criterion', Computers & Operations Research, Vol. 32, pp.2197-2212.
28. Grabowski, J. and Syslo, M. (1973) 'On some machine sequencing problems (I)', Applications of Mathematicae, Vol. 13, pp.340-345.
29. Guirchoun, S., Martineau, P. and Billaut, J.C. (2005) 'Total completion time minimization in a computer system with a server and two parallel processors', Computers & Operations Research, Vol. 32, pp.599-611.
30. Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M. (1997) 'Two-stage no-wait scheduling models with setup and removal times separated', Computers & Operations Research, Vol. 24, No. 1, pp.1025-1031.
31. Hall, N. and Sriskandarajah, C. (1996) 'A survey of machine scheduling problems with blocking and no-wait in process', Operations Research, Vol. 44, pp.510-525. (Pubitemid 126669516)
32. Huang, R. H., Yang, C-L. and Huang, Y-C. (2009) 'No-wait two-stage multiprocessor flow shop scheduling with unit setup', The International Journal of Advanced Manufacturing Technology, Vol. 44, pp.921-927.
33. King, J. and Spachis, A. (1980) 'Heuristics for flowshop scheduling', International Journal of Production Research, Vol. 18, pp.343-357.
34. Laha, D. and Chakraborty, U.K. (2009) 'A constructive heuristic for minimizing makespan in no-wait flow shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 41, pp.97-109.
35. Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R. and Shmoys, D.B. (1993) 'Sequencing and scheduling: algorithms and complexity', S.C. Graves, A.H.G.R. Kan and P. Zipkin (Eds.): Handbooks in Operations Research and Management Science, North-Holland.
36. Liu, B., Wang, L. and Jin, Y-H. (2007) 'An effective hybrid particle swarm optimization for no-wait flow shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 31, pp.1001-1011. (Pubitemid 46092501)
37. Papadimitriou, C.H. and Kanellakis, P.C. (1980) 'Flowshop scheduling with limited temporary storage', Journal of the Associated Computer Machinery, Vol. 20, pp.533-549.
38. Pranzo, M. (2004) 'Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times', European Journal of Operational Research, Vol. 153, No. 3, pp.581-592.
39. Rajendran, C. (1994) 'A no-wait flowshop scheduling heuristic to minimize makespan', Journal of the Operational Research Society, Vol. 45, pp.472-478.
40. Rajendran, C. and Chaudhuri, D. (1990) 'Heuristic algorithms for continuous flow-shop problem', Naval Research Logistics, Vol. 37, pp.695-705. (Pubitemid 21648558)
41. Reddi, S. and Ramamoorthy, C. (1972) 'On the flowshop sequencing problem with no-wait in process', Operational Research Quarterly, Vol. 23, pp.323-331.
42. Rochat, Y. and Taillard, E. (1995) 'Probabilistic diversification and intensification in local search for vehicle routing', Journal of Heuristics, Vol. 1, pp.147-167.
43. Röck, H. (1984) 'Some new results in flow shop scheduling', Zeitschrift för Operations Research, Vol. 28, pp.1-16. (Pubitemid 14582721)
44. Sidney, J., Potts, C. and Sriskandarayah, C. (2000) 'Heuristic for scheduling two-machine no-wait flow shops with anticipatory setups', Operations Research Letters, Vol. 26, No. 4, pp.165-173.
45. Su, L.H. and Lee, Y.Y. (2008) 'The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time', Computers & Operations Research, Vol. 35, pp.2952-2963.
46. Svirenko, M. (2003) 'Makespan minimization in no-wait flow shops: a polynomial time approximation scheme', SIAM Journal on Discrete Mathematics, Vol. 16, No. 2, pp.313-322.
47. Wismer, D. (1972) 'Solution of the flowshop-scheduling with no intermediate queues', Operations Research, Vol. 20, pp.689-697.6p