A genetic programming heuristic for the one-machine total tardiness problem

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 3, Issue , 1999, Pages 2207-2214

  Dimopoulos, Christos ^a   Zalzala, Ali M S ^b  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

BENCH-MARK PROBLEMS; DISPATCHING RULES; HYBRIDISATION; LOCAL SEARCH TECHNIQUES; OPTIMISATION PROBLEMS; PROGRAMMING FRAMEWORK; QUALITY OF SOLUTION; TOTAL TARDINESS;

GENETIC PROGRAMMING;

EID: 84901444525     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.785549     Document Type: Conference Paper

References (30)

1. Dimopoulos, C. and Zalzala, A. M. S., "Evolutionary computation for manufacturing optimisation: Recent developments", Research Report no. 716, Dept. of Automatic Control & Systems Engineering, University of Sheffield, 1998.
2. st Annual Conference, Koza, Goldberg, Fogel & Riolo (Eds.), pp. 182-190, MIT Press, 1996.
3. Polheim, H. and Marenback, P., "Generation of structured process models using genetic programming", in Evolutionary Computing. AISB Workshop. Selected Papers, Lecture Notes in Computer Science (1143), T. C. Fogarty (Ed.), pp. 102-109, Springer-Verlag, Berlin, Germany, 1996.
4. McKay, B. M., Willis, M. J, Hiden, H. G., Montague, G. A. and Barton, G. W., "Identification of industrial processes using genetic programming", in Proc.of the Conf.on Identification in Engineering Systems, Friswell & Mottershead (Eds.), pp. 510-519, Univ. of Wales, Swansea, UK. 1996.
5. Potts, C. N. and Van Wassenhove, L. N., "A decomposition algorithm for the single machine total tardiness problem", Operations Research Letters, 1(5), 177-181, 1982.
6. Dimopoulos, C. and Zalzala, A. M. S., "Investigating the use of genetic programming for a classic one-machine scheduling problem", Research Report no. 737, Dept. of Automatic Control & Systems Engineering, t University of Sheffield, 1998.
7. Bellman, RE. and Dreyfus, S. E., Applied Dynamic Programming, Princeton University Press, 1962.
8. Lawler, E. L., "On scheduling problems with deferral costs", Management Science, 11(2), 280-288, 1964.
9. Srinivasan, V., "A hybrid algorithm for the one machine sequencing problem to minimize total tardiness", Naval Research Logistics Quarterly, 18(3), 317-327, 1971.
10. Baker, K. R. and Schrage, L. E., "Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks", Operations Research, 26(1), 111-120, 1978.
11. Schrage, L. E. and Baker, K. R, "Dynamic programming solution of sequencing problems with precedence constraints", Operations Research, 26(3), 444-449, 1978.
12. Ibaraki, T. and Nakamura, Y. (1994), "A dynamic programming method for single machine scheduling", European Journal of Operational Research, 76, 72-81, 1994.
13. Emmons, H., "One machine sequencing to minimise certain function of job tardiness", Operations Research, 17(4), 701-715, 1968.
14. Elmaghraby, S. E, "The one machine sequencing problem with delay costs", Journal of Industrial Engineering, 19(2), 105-108, 1968.
15. Shwimer, J., "On the N-job, one-machine, sequenceindependent scheduling problem with tardiness penalties: a branch & bound approach", Management Science, 18(6), 301-313, 1972.
16. Rinnooy Kan, A. H. G, Lageweg, B. J. and Lenstra J. K., "Minimising total costs in one-machine scheduling", Operations Research, 23(5), 908-927, 1975.
17. Fisher, M. L., "A dual algorithm for the one-machine scheduling problem", Mathematical Programming, 11(3), 229-251, 1976.
18. Picard, J and Queyranne, M., "The time-dependent travelling salesman problem and its application to the tardiness problem in one-machine scheduling", Operations Research, 26(1), 86-110, 1978.
19. Potts, C. N. and Van Wassenhove, L. N., "A branch & bound algorithm for the total weighted tardiness problem", Operations Research, 33, 363-377, 1985.
20. Wilkerson, L. J. and Irwin, J. D., "An improved algorithm for scheduling for independent tasks", AIIE Transactions, 3(3), 239-245, 1971.
21. Fry, T. D., Vicens, L., Macleod, K. and Fernadez S., "A heuristic solution procedure to minimize total tardiness", Journal of the Operational Research Society, 40, 293-297, 1989.
22. Holsenback, J. E. and Russel, R. M., "A heuristic algorithm for sequencing on one machine to minimize total tardiness", Journal of the Operational Research Society, 43, 53-62, 1992.
23. Holsenback, J. E. and Russel, R. M., "Evaluation of greedy, myopic and less-greedy heuristics for the singlemachine, total tardiness problem", Journal of the Operational Research Society, 48, 640-646, 1997.
24. Panwalkar, S. S., Smith, M. L. and Koulamas, C. P., "A heuristic for the single machine tardiness problem", European Journal of Operational Reserarch, 70, 304-310, 1993.
25. Potts, C. N. and Van Wassenhove, L. N., "Single machine tardiness sequencing heuristics", IIE Transactions, 23 (4) 346-354, 1991.
26. Ben-Daya, M. and Al-Fawzan, M., "A simulated annealing approach for the one-machine mean tardiness scheduling problem", European Journal of Operational Research, 93, 61-67, 1996.
27. Koza, J. R, Genetic Programming: On the programming of Computers by Means of Natural Selection. MIT Press, Cambridge, 1992.
28. Blackstone, J. H, Philips, D. T and Hogg, C. L., "A state of the art survey of dispatching rules for manufacturing job shop operations", Int. J. of Production Research, 20, pp. 27-45, 1982.
29. Montagne, G. R., "Sequencing with time delay costs", Industrial Engineering Research Bulletin, 5, Arizona State University, 1969.
30. Baker, K., Introduction to Sequencing and Scheduling, Whiley, New York, 1974.