Investigating the use of genetic programming for a classic one-machine scheduling problem

Advances in Engineering Software

Volumn 32, Issue 6, 2001, Pages 489-498

  Dimopoulos, C ^a   Zalzala, A M S ^b  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Evolutionary computation; Genetic programming; Manufacturing optimisation; Scheduling; Tardiness

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER AIDED MANUFACTURING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

GENETIC PROGRAMMING;

SOFTWARE ENGINEERING;

EID: 0035370796     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(00)00109-5     Document Type: Article

References (30)

1. Recent developments in evolutionary computation for manufacturing optimisation: Problems, solutions and comparisons
2. Optimisation by simulated annealing
3. Tabu search: A tutorial
4. Solving facility layout problems using genetic programming
5. Identification of industrial processes using genetic programming
6. A decomposition algorithm for the single machine total tardiness problem
7. A pseudopolynomial algorithm for sequencing jobs to minimise total tardiness
8. Complexity of machine scheduling problems
9. Minimising total tardiness on one machine is NP-hard
10. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
11. The one machine sequencing problem with delay costs
12. Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks
13. Dynamic programming solution of sequencing problems with precedence constraints
14. A heuristic solution procedure to minimize total tardiness
15. A heuristic algorithm for sequencing on one machine to minimize total tardiness
16. Evaluation of greedy, myopic and less-greedy heuristics for the single-machine, total tardiness problem
17. A heuristic for the single machine tardiness problem
18. A representation for the adaptive generation of simple sequential programs
19. Using the genetic algorithm to generate LISP source code to solve the prisoner's dilemma
20. A compiling genetic programming system that directly manipulates machine code
21. PADO: A new learning architecture for object recognition
22. A state of the art survey of dispatching rules for manufacturing job shop operations
23. A survey of priority rule-based scheduling
24. One machine sequencing to minimise certain function of job tardiness
25. Sequencing with time delay costs
26. A genetic programming heuristic for the one-machine total tardiness problem