A rescheduling heuristic for the single machine total tardiness problem
In this paper, we propose a rescheduling heuristic for scheduling N jobs on a single machine in order to minimise total tardiness. The heuristic is of the interchange type and constructs a schedule from the modified due date (MDD) schedule. Unlike most interchange heuristics that consider interchang...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Operations Research Society of South Africa (ORSSA)
2006-06-01
|
| Series: | ORiON |
| Online Access: | http://orion.journals.ac.za/pub/article/view/34 |