An ant colony system approach for scheduling problems

Production Planning and Control

Volumn 14, Issue 1, 2003, Pages 68-75

  Ying, Kuo Ching ^a,b   Liao, Ching Jong ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b HUAFAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony system; Scheduling; Simple constructive heuristics

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; HEURISTIC METHODS;

ANT COLONY SYSTEM (ACS) APPROACH;

SCHEDULING;

EID: 0142258724     PISSN: 09537287     EISSN: None     Source Type: Journal    
DOI: 10.1080/0953728031000089988     Document Type: Article

References (16)

1. ALBERTO, C., MARCO, D., VITTORIO, M., and MARCO, T., 1994, Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34, 39-53.
2. ALLIDAEE, B., and RAMAKRISHNAN, K. R., 1996, A computational experiment of covert-au class of rules for single machine tardiness scheduling problem. Computers Industrial Engineering, 30, 201-209.
3. DORIGO, M., and GAMBARDELLA, L. M., 1997, Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53-66.
4. DORIGO, M., DI CARO, G., and GAMBARDELLA, L. M., 1999, Ant algorithms for discrete optimisation. Artificial Life, 5, 137-172.
5. ELVERS, D. A., and TAUBE, L. R., 1983, Time completion for various dispatching rules in job shops. OMEGA, 11, 81-89.
6. GAMBARDELLA, L. M., and DORIGO, M., 2001, An ant colony system hybridised with a new local search for the sequential ordering problem. Accepted for publication in Informs Journal on Computing.
7. HAUPT, R., 1989, A survey of priority rule-based scheduling. OR Spektrum, 11, 3-16.
8. HOLTHAUS, O., and RAJENDRAN, C., 2000, Efficient jobshop dispatching rules: further developments. Production Planning & Control, 11, 171-178.
9. LAWLER, E. L., 1964, On scheduling problems with deferral cost. Management Science, 11, 280-288.
10. McNAUGHTON, R., 1959, Scheduling with deadlines and loss functions. Management Science, 6, 1-12.
11. MORTON, T. E., RACHAMADUGU, R. M. V., and VEPSALAINEN, A. P. J., 1984, Accurate myopic heuristics for tardiness scheduling. Carnegie Mellon University, Working Paper W. P. 36-83-84.
12. PANWALKAR, S. S., and ISKANDER, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
13. PINEDO, M., and CHAO, X., 1999, Operations Scheduling with Applications in Manufacturing and Services (McGraw-Hill).
14. POTTS, C. N., and VAN WASSENHOVE, L. N., 1991, Single machine tardiness sequencing heuristics. IIE Transactions, 23, 346-354.
15. ROY, B., and SUSSMANN, B., 1964, Les problems d'ordonnancement avec contraintes disjunctives. Note DS n.9 bis, SEMA, Montrouge.
16. VEPSALAINEN, A. P. J., and MORTON, T. E., 1987, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.