Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems

International Journal of Advanced Manufacturing Technology

Volumn 33, Issue 7-8, 2007, Pages 793-802

  Ying, Kuo Ching ^a   Lin, Shih Wei ^a  

^a HUAFAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Non permutation flowshop; Scheduling

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; SCHEDULING;

ANT COLONY OPTIMIZATION (ACO); ANT COLONY SYSTEM (ACS); NONPERMUTATION FLOWSHOP SCHEDULING;

OPERATIONS RESEARCH;

EID: 34249903338     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0492-8     Document Type: Article

References (35)

1. Dudek RA, Panwalkar SS, Smith ML (1992) The lessons of flowshop scheduling research. Oper Res Soc Am 40:7-13
2. Itoulamas C (1998) A new constructive heuristic for the flowshop scheduling problem. Eur J Oper Res 105:66-71
3. Reisman A, Kumar A, Motwani J (1997) Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Trans Eng Manage 44:316-329
4. King JR, Spachis AS (1980) Heuristics for flow-shop scheduling. Int J Prod Res 18:345-357
5. Park YB, Pegden CD, Enscore EE (1984) A survey and evaluation of static flowshop scheduling heuristics. Int J Prod Res 22:127-141
6. Turner S, Booth D (1987) Comparison of heuristics for flow shop sequencing. OMEGA 15:75-85
7. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117-129
8. Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Eur J Oper Res 41:186-193
9. max flowshop problem. Comput Oper Res 17:243-253
10. Chen CL, Vempati VS, Aljaber N (1995) An application of genetic algorithms for flow shop problems. Eur J Oper Res 80:389-396
11. Potts CN, Van Wassenhove LN (1991) Single machine tardiness sequencing heuristics. IIE Trans 23:346-354
12. Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Arti Life 5:137-172
13. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ants colonies. In: Verela F, Bourgine P (eds) Proceedings of the first European Conference on Artificial Life (ECAL'91). MIT Press, Cambridge, Mass, USA, pp 134-142
14. Dorigo M (1992) Optimization, learning and natural algorithms. PhD Thesis, DEI, Politecnico di Milano, Italy
15. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolu Comput 1:53-66
16. Gambardella LM, Dorigo M (1997) HAS-SOP: hybrid ant system for the sequential ordering problem. Technical Report IDSIA-11-97, IDSIA, Lugano, Switzerland
17. Gambardella LM, Taillard E, Dorigo M (1999) Ant colonies for the quadratic assignment problem. J Oper Res Soc 50:167-176
18. Bullnheimer B, Hartl RF, Strauss C (1999) An improved ant system algorithm for the vehicle routing problem, Ann Oper Res 89:319-334
19. Costa D, Hertz A (1997) Ants can colour graphs. J Oper Res Soc 48:295-305
20. Kuntz P, Layzell P, Snyers D (1997) A colony of ant-like agents for partitioning in VLSI technology. Proceedings of the Fourth European Conference on Artificial Life. The MIT Press, Cambridge, MA
21. Song YH, Chou CS (1998) Application of ant colony search algorithms in power system optimization. IEEE Power Eng Rev 18:63-64
22. Di Caro G, Dorigo M (1998) AntNet: distributed stigmergetic control for communications networks. J Arti Intel Res 9:317-365
23. Gagne C, Price WL, Gravel M (2002) Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J Oper Res Soc 53:895-906
24. Ying KC, Liao CJ (2003) An ant colony system approach for scheduling problem. Prod Plan Cont 14:68-75
25. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155:426-38
26. Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31:791-801
27. Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belgian J Oper Res Stat Comput Sci (JORBEL) 34:39-53
28. Christian B (2005) Beam-ACO hybridizing ant colony optimization with beam search: an application to openshop scheduling. Comput Oper Res 32:1565-1591
29. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discete Math 5:287-362
30. James ED, Michael PH (1970) Review of sequencing research. Nav Res Log Q 17:11-39
31. Haupt R (1989) A survey of priority rule-based scheduling. OR Spek 11:3-16
32. Chang YL, Toshiyuki S, Robert SS (1996) Ranking dispatching rules by data envelopment analysis in a job shop environment. HE Trans 28:631-642
33. Holthaus O, Rajendran C (2000) Efficient jobshop dispatching rules: further developments. Prod Plan Cont 11:171-178
34. Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Euro J Oper Res 109:137-141
35. Pinedo M (1995) Scheduling: theory, algorithms and system. Prentice-Hall, New Jersey