An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops

International Journal of Production Economics

Volumn 101, Issue 2, 2006, Pages 259-272

  Gajpal, Yuvraj ^a   Rajendran, Chandrasekharan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Ant colony algorithm; Completion time variance; Flowshop; Scheduling

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ANT-COLONY ALGORITHM; COMPLETION-TIME VARIANCE; FLOWSHOP; PERMUTATION FLOWSHOP;

INDUSTRIAL ECONOMICS;

EID: 31744439035     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2005.01.003     Document Type: Article

References (32)

1. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics 77 2002 71 83
2. U. Bagchi, R.S. Sullivan, and Y. Chang Minimizing mean squared deviation of completion times about a common due date Management Science 33 1987 894 906
3. M. Ben-Daya, and M. Al-Fawzan A tabu search approach for the flowshop scheduling problem European Journal of Operational Research 109 1998 88 95
4. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n-job, m-machine sequence problem Management Science 16 1970 B630 B637
5. P.-C. Chang, J.-C. Hsieh, and S.-G. Lin The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem International Journal of Production Economics 79 2002 171 183
6. C.-S. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems International Journal of Production Economics 79 2002 185 196
7. M. Dorigo, V. Maniezzo, and A. Colorni The ant system: Optimization by a colony of cooperating agents IEEE Transactions on Systems, Man and Cybernetics - Part B 26 1996 29 41
8. S. Eilon, and I.G. Chowdhury Minimizing waiting time variance in the single machine problem Management Science 23 1977 567 575
9. L.F. Gelders, and N. Sambandam Four simple heuristics for scheduling a flow-shop International Journal of Production Research 16 1978 221 231
10. K. Gowrishankar, C. Rajendran, and G. Srinivasan Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date European Journal of Operational Research 132 2001 643 665
11. J.C. Ho Flowshop sequencing with mean flow time objective European Journal of Operational Research 81 1995 571 578
12. E. Ignall, and L. Schrage Application of the branch-and-bound technique to some flowshop scheduling problems Operations Research 13 1965 400 412
13. H. Ishibuchi, S. Misaki, and H. Tanaka Modified simulated annealing algorithms for the flowshop sequencing problems European Journal of Operational Research 81 1995 388 398
14. S.M. Johnson Optimal two-and three-stage production schedules Naval Research Logistics Quarterly 1 1954 61 68
15. J.J. Kanet Minimising variance of flow time in single machine system Management Science 27 1981 1453 1458
16. W. Kubiak Completion time variance minimization on a single machine is difficult Operations Research Letters 14 1993 49 59
17. i scheduling problem European Journal of Operational Research 132 2001 439 452
18. Merkle, D., Middendorf, M., 2000. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, Lecture Notes in Computer Science, Springer, vol. 1803, Springer, Berlin, pp. 287-296.
19. A.G. Merten, and A.E. Muller Variance minimization single machine sequencing problems Management Science 18 1972 518 528
20. S. Miyazaki, and N. Nishiyama Analysis for minimizing weighted mean flowtime in flowshop scheduling Journal of the Operations Research Society of Japan 23 1980 118 132
21. S. Miyazaki, N. Nishiyama, and F. Hashimoto An adjacent pairwise approach to the mean flowtime scheduling problem Journal of the Operations Research Society of Japan 21 1978 287 299
22. M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flowshop sequencing problem OMEGA 11 1983 91 95
23. M. Raghavachari Scheduling problems with non-regular penalty functions - a review Operations Research 25 1988 144 164
24. C. Rajendran Heuristics for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1993 65 73
25. C. Rajendran Heuristics for scheduling in a flowshop with multiple objectives European Journal of Operational Research 82 1995 540 555
26. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2004 426 438
27. Rajendran, C., Ziegler, H., 2005. Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering Forthcoming.
28. Stuetzle, T., 1998. An ant approach for the flow shop problem. In: Proceedings of the Sixth European Congress on Intelligent Techniques & Soft Computing (EUFIT'98), vol. 3, Verlag Mainz, Aachen, Germany, pp. 1560-1564.
29. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
30. V. Vani, and M. Raghavachari Deterministic and random single machine sequencing with variance minimization Operations Research 35 1987 111 120
31. M. Widmer, and A. Hertz. A new heuristic method for the flowshop sequencing problem European Journal of Operational Research 41 1989 186 193
32. H.S. Woo, and D.S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers and Operations Research 25 1998 175 182