Solving permutation flow shop sequencing using ant colony optimization

IEEM 2007: 2007 IEEE International Conference on Industrial Engineering and Engineering Management

Volumn , Issue , 2007, Pages 753-757

  Ahmadizar, Fardin ^a,b   Barzinpour, Farnaz ^a   Arkat, Jamal ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b UNIVERSITY OF KURDISTAN   (Iran)

Author keywords

Ant colony optimization; Makespan; Permutation flow shop; Scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

ANT COLONY OPTIMIZATION; JOHNSON'S RULE;

GLOBAL OPTIMIZATION;

EID: 40649087168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEEM.2007.4419291     Document Type: Conference Paper

References (49)

1. M.R. Garey, D.S. Johnson, R. Sethi, "The complexity of flowshop and jobshop scheduling," Math. Oper. Res., vol. 1, pp. 117-129, 1976.
2. A.H.G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity, & Computations, Martinus Nijhoff, The Hague, 1976.
3. S.P. Bansal, "Minimizing the sum of completion times of n-jobs over M-machines in a flowshop - a branch and bound approach," AIIE Trans., vol. 9, pp. 306-311, 1977.
4. E. Ignall, L. Schrage, "Application of the branch-and-bound technique to some flowshop scheduling problems," Oper. Res., vol. 13, pp. 400-412, 1965.
5. Z.A. Lomnicki, "A branch and bound algorithm for the exact solution of the three-machine scheduling problem," Oper. Res. Quart., vol. 16, no. 1, pp. 89-100, 1965.
6. E.F. Stafford, "On the development of a mixed integer linear programming model for the flowshop sequencing problem," J. Oper. Res. Soc., vol. 39, pp. 1163-1174, 1988.
7. A. Allahverdi, T. Aldowaisan, "New heuristics to minimize total completion time in m-machine flowshops," Int. J. Prod. Econ., vol. 77, pp. 71-83, 2002.
8. H.G. Campbell, R.A. Dudek, M.L. Smith, "A heuristic algorithm for the n job, m machine sequencing problem," Manag. Scie., vol. 16, no. 10, pp. B630-B637, 1970.
9. J.M. Framinan, R. Leisten, "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," OMEGA, vol. 31, pp. 311-317, 2003.
10. J.M. Framinan, R. Leisten, "A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness," Int. J. Prod. Econ., vol. 99, pp. 2840, 2006.
11. J.M. Framinan, R. Leisten, R. Ruiz-Usano, "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," Eur. J. Oper. Res., vol. 141, pp. 559-569, 2002.
12. L.F. Gelders, N. Sambandam, "Four simple heuristics for scheduling a flow-shop," Int. J. Prod. Res., vol. 16, pp. 221-231, 1978.
13. J.N.D. Gupta, "Heuristic algorithms for multistage flowshop scheduling problem," AIIE Trans., vol. 4, pp. 11 -18, 1972.
14. J.C. Ho, "Flowshop sequencing with mean flow time objective," Eur. J. Oper. Res., vol. 81, pp. 571-578, 1995.
15. J.C. Ho, Y.L. Chang, "A new heuristic for the n-job, M-machine flowshop problem," Eur. J. Oper. Res., vol. 52, pp. 194-202, 1991.
16. S. Miyazaki, N. Nishiyama, "Analysis for minimizing weighted mean flowtime in flowshop scheduling," J. Oper. Res. Soc. of Japan, vol. 23, pp. 118-132, 1980.
17. S. Miyazaki, N. Nishiyama, F. Hashimoto, "An adjacent pairwise approach to the mean flowtime scheduling problem," J. Oper. Res. Soc. of Japan, vol. 21, pp. 287-299, 1978.
18. M. Nawaz, E. Enscore Jr., I. Ham, "A heuristic algorithm for the m-machine, n-job flow shop sequencing problem," OMEGA, vol. 11, no. 1, pp. 91-95, 1983.
19. D.S. Palmer, "Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum," Oper. Res. Quart., vol. 16, pp. 101-107, 1965.
20. C. Rajendran, "Heuristic algorithm for scheduling in a flowshop to minimize total flowtime," Int. J. Prod. Econ., vol. 29, pp. 65-73, 1993.
21. C. Rajendran, D. Chaudhuri, "A flowshop scheduling algorithm to minimize total flowtime," J. Oper. Res. Soc. of Japan, vol. 34, pp. 2845, 1991.
22. C. Rajendran, D. Chaudhuri, "An efficient heuristic approach to the scheduling of jobs in a flowshop," Eur. J. Oper. Res., vol. 61, pp. 318-325, 1991.
23. C. Rajendran, H. Ziegler, "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," Eur. J. Oper. Res., vol. 103, pp. 129-138, 1997.
24. S. Sarin, M. Lefoka, "Scheduling heuristic for the n-job m-machine flow shop," OMEGA, vol. 21, no. 2, pp. 229-234, 1993.
25. M. Ben-Daya, M. Al-Fawzan, "A tabu search approach for the flow shop scheduling problem," Eur. J. Oper. Res., vol. 109, pp. 88-95, 1998.
26. J. Grabowski, J. Pempcra, "New block properties for the permutation flow-shop problem with application in TS," J. Oper. Res. Soc., vol. 52, pp. 210-220, 2001.
27. J. Grabowski, M. Wodecki, "A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion," Comp. & Oper. Res., vol. 31, no. 11, pp. 1891-1909, 2004.
28. E. Nowicki, C. Smutnicki, "A fast tabu search algorithm for the permutation flowshop problem," Eur. J. Oper. Res., vol. 91, pp. 160-175, 1996.
29. C. Reeves, "Improving the efficiency of tabu search for machine sequencing problem," J. Oper. Res. Soc., vol. 44, no. 4, pp. 375-382, 1993.
30. T. Murata, H. Ishibuchi, H. Tanaka, "Genetic algorithms for flowshop scheduling problems," Comp. & Ind. Eng., vol. 30, no. 4, pp. 1061-1071, 1996.
31. C. Reeves, "A genetic algorithm for flowshop sequencing," Comp. & Oper. Res., vol. 22, no. 1, pp. 5-13, 1995.
32. C. Reeves, T. Yamada, "Genetic algorithms, path relinking and the flowshop sequencing problem," Evolu. Comp., vol. 6, pp. 45-60, 1998.
33. H. Ishibuchi, S. Misaki, H. Tanaka, "Modified simulated annealing algorithms for the flow shop sequencing problems," Eur. J. Oper. Res., vol. 81, pp. 388-398, 1995.
34. max, flowshop problem," Comp. & Oper. Res., vol. 17, no. 3, pp. 243-253, 1990.
35. F. Ogbu, D. Smith, "Simulated annealing for the permutation flowshop problem," OMEGA, vol. 19, pp. 64-77, 1991.
36. I. Osman, C. Potts, "Simulated annealing for permutation flow shop scheduling," OMEGA, vol. 17, no. 6, pp. 551-557, 1989.
37. Z. Lian, X. Gu, B. Jiao, "A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan," Chaos, Soli. & Frac., in press.
38. Z. Lian, X. Gu, B. Jiao, "A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan," Appl. Math. & Comp., vol. 175, pp. 773-785, 2006.
39. C.J. Liao, C.T. Tseng, P. Luam, "A discrete version of particle swarm optimization for flowshop scheduling problems," Comp. & Oper. Res., vol. 34, pp. 3099-3111, 2007.
40. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, G. Gencyilmaz, "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," Eur. J. Oper. Res., vol. 177, pp. 1930-1947, 2007.
41. M. Dorigo, V. Maniezzo, A. Colorni, "The ant system: Optimization by a colony of cooperating agents," IEEE Trans. on Sys., Man and Cyber., Part B, vol. 26, pp. 2941, 1996.
42. M. Dorigo, "Optimization, learning and natural algorithm," (in Italian), Ph.D. thesis, DEI, Politecnico di Milano, Itally, 1992.
43. T. Stuetzle, "An ant approach for the flow shop problem," in Proc. of the sixth Eur. Congress on intelligent techq. & soft comp., (EUFIT '98), Aachen: Verlag Mainz 3, pp. 1560-1564, 1998.
44. C. Rajendran, H. Ziegler, "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," Eur. J. Oper. Res., vol. 155, pp. 426438, 2004.
45. K.C. Ying, C.J. Liao, "An ant colony system for permutation flowshop sequencing," Comp. & Oper. Res., vol. 31, pp. 791-801, 2004.
46. C. Rajendran, H. Ziegler, "Two ant-colony algorithms for minimizing total flowtime in permutation flowshops," Comp. & Ind. Eng., vol. 48, pp. 789-797, 2005.
47. Y. Gajpal, C. Rajendran, "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," Int. J.Prod. Econ., vol. 101, pp. 259-272, 2006.
48. M. Dorigo, L.M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Trans. on Evolu. Comp., vol. 1, pp. 53-66, 1997.
49. E. Taillard, "Benchmarks for basic scheduling problems," Eur. J. Oper. Res., vol. 64, pp. 278-285, 1993.