Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time

Computers and Industrial Engineering

Volumn 47, Issue 2-3, 2004, Pages 181-193

  Shyu, S J ^a   Lin, B M T ^b   Yin, P Y ^c  

^a MING CHUAN UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Meta heuristics; Production; Scheduling

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION; TRAVELING SALESMAN PROBLEM;

ANT COLONY OPTIMIZATION; META-HEURISTICS;

SCHEDULING;

EID: 6344253119     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2004.06.006     Document Type: Article

References (35)

1. Aldowaisan, T. (2001). A new heuristic and dominance relations for no-wait flowshops with setups. Computers and Operations Research, 28, 563-584.
2. Aldowaisan, T., & Allahverdi, A. (1998). Total flow time in no-wait flowshops with separated setup times. Computers and Operations Research, 25, 757-765.
3. Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27, 219-239.
4. Bullnheimer, B., (1999). Ant Colony Optimization in Vehicle Routing. Doctoral thesis, University of Vienna, Austria.
5. Bullnheimer, B., Hartl, R. F., & Strauss, C. (2001). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319-328.
6. Busch, I.K., (1991). Vehicle Routing on Acylic Networks. PhD Dissertation. Johnsons Hopkins University, Baltimore, MD.
7. Cheng, T. C. E., Gupta, J. N. D., & Wang, G. (2000). A review of flowshop scheduling research with setup times. Productions and Operations Management, 9, 262-282.
8. Colorni, A., Dorigo, M., Maffioli, P., Maniezzo, F., Righini, G., & Trubian, M. (1996). Heuristics from nature for hard combinatorial problems. International Transactions on Operations Research, 3, 1-21.
9. Colorni, A., Dorigo, M., & Maniezzo, V. (1991). In F. J. Varela, & P. Bourgine, Distributed optimization by ant colonies. Proceedings of the First European Conference on Artificial Life, Paris.
10. Colorni, A., Dorigo, M., Maniezzo, M., & Trubian, M. (1994). Ant system for job-shop scheduling. JORBEL - Belgium Journal of Operational Research, Statistics and Computer Science, 34, 39-53.
11. Dorigo, M., Di Caro, G., & Gambardella, L. M. (1999). Ant algorithms for discrete optimization. Artificial Life, 5, 137-172.
12. Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computing, 1, 53-66.
13. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics: B, 26, 29-41.
14. Fischetti, M., Laporte, G., & Martello, S. (1993). The delivery man problem and cumulative matroids. Operations Research, 41, 1055-1064.
15. Gambardella, L. M., Taillard, E., & Dorigo, M. (1999). Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50, 167-176.
16. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freedman.
17. Gilmore, P. C., & Gomory, R. E. (1964). Sequencing on a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research, 12, 655-679.
18. Glover, F. (1990). Tabu search: a tutorial. Interfaces, 20, 74-94.
19. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Learning. New York: Addison Wesley.
20. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
21. Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with locking and no-wait in process. Operations Research, 44, 510-525.
22. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan.
23. Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61-67.
24. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
25. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell Systems Technology Journal, 44, 2245-2269.
26. Potts, C. N., & Kovalyov, M. K. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228-249.
27. Rajendran, C., & Chaudhuri, D. (1990). Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics, 37, 695-705.
28. Reisman, A., Kumar, A., & Motwani, J. (1997). Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994. IEEE Transactions on Engineering Management, 44, 316-329.
29. Sahni, S., & Gonzalez, T. (1976). P-complete approximation problems. Journal of the ACM, 23, 555-565.
30. Shyu, S. J., Yin, P. Y., Lin, B. M. T., & Haouari, M. (2003). Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. Journal of Experimental and Theoretical Artificial Intelligence, 15, 103-112.
31. Shyu, S. J., Yin, P. Y., & Lin, B. M. T. (2004). An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research, 131, 283-304.
32. Simchi-Levi, D., & Berman, O. (1991). Minimizing the total flow time of n jobs on a network. IIE Transactions, 23, 236-244.
33. Stutzle, T., & Dorigo, M. (1999). ACO algorithms for the traveling salesman problem. In K. Miettinen, M. Makela, P. Neittaanmaki, & J. Periaux (Eds.), Evolutionary Algorithms in Engineering and Computer Science. New York: Wiley.
34. Tsitsiklis, J. (1992). Special cases of traveling salesman and repairman problems with time windows. Networks, 22, 263-282.
35. van Eijl, C. A. (1995). A Polyhedral Approach to the Delivery Man Problem. Technical Report 95-19, Department of Mathematics and Computer Science. The Netherlands: Eindhoven University of Technology.