Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

European Journal of Operational Research

Volumn 155, Issue 2, 2004, Pages 426-438

  Rajendran, Chandrasekharan ^a   Ziegler, Hans ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

Ant colony algorithm; Flowshop; Heuristics; Makespan; Scheduling; Total flowtime

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

ANT-COLONY ALGORITHM; FLOWSHOP; MAKESPAN; TOTAL FLOWTIME;

SCHEDULING;

EID: 1642559633     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00908-6     Document Type: Article

References (27)

1. Ben-Daya M., Al-Fawzan M. A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research. 109:1998;88-95.
2. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm for the. n -job, m -machine sequencing problem Management Science. 16:1970;B630-B637.
3. Dorigo, M., 1992. Optimization, learning and natural algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy.
4. Dorigo M., Maniezzo V., Colorni A. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics - Part B. 26:1996;29-41.
5. Gelders L.F., Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research. 16:1978;221-231.
6. Ho J.C. Flowshop sequencing with mean flow time objective. European Journal of Operational Research. 81:1995;571-578.
7. Ignall E., Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research. 13:1965;400-412.
8. Ishibuchi H., Misaki S., Tanaka H. Modified simulated annealing algorithms for the flow shop sequencing problems. European Journal of Operational Research. 81:1995;388-398.
9. Johnson S.M. Optimal two- and three-stage production schedules. Naval Research Logistics Quarterly. 1:1954;61-68.
10. i scheduling problem European Journal of Operational Research. 132:2001;439-452.
11. Merkle D., Middendorf M. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. Proceedings of the EvoWorkshops 2000. Lecture Notes in Computer Science. vol. 1803:2000;287-296 Springer-Verlag, Berlin.
12. Miyazaki S., Nishiyama N. Analysis for minimizing weighted mean flowtime in flowshop scheduling. Journal of the Operations Research Society of Japan. 23:1980;118-132.
13. Miyazaki S., Nishiyama N., Hashimoto F. An adjacent pairwise approach to the mean flowtime scheduling problem. Journal of Operations Research Society of Japan. 21:1978;287-299.
14. Nawaz M., Enscore E.E. Jr., Ham I. A heuristic algorithm for the. m -machine, n -job flowshop sequencing problem OMEGA. 11:1983;91-95.
15. Nowicki E., Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research. 91:1996;160-175.
16. Rajendran C. Two-machine flowshop scheduling problem with bicriteria. Journal of Operational Research Society. 43:1992;871-884.
17. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics. 29:1993;65-73.
18. Rajendran C. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research. 82:1995;540-555.
19. Rajendran C., Ziegler H. Heuristics for scheduling in a flowshop with setup, processing and removal times separated. Production Planning and Control. 8:1997;568-576.
20. Rajendran C., Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research. 103:1997;129-138.
21. Rajendran C., Ziegler H. Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs. Computers and Industrial Engineering. 37:1999;671-690.
22. Stuetzle T. An ant approach for the flow shop problem. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT '98), vol. 3. 1998;1560-1564 Verlag Mainz, Aachen, Germany.
23. Stuetzle T., Hoos H.H. Max-min ant system. Future Generation Computer Systems. 16:2000;889-914.
24. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64:1993;278-285.
25. i scheduling problems European Journal of Operational Research. 96:1997;636-644.
26. Widmer M., Hertz A. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research. 41:1989;186-193.
27. Woo H.S., Yim D.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research. 25:1998;175-182.