A new decomposition approach for the single machine total tardiness scheduling problem
1998
This paper deals with the single machine total tardiness problem. From Emmons’ basic dominance conditions a new partition theorem is derived which generalises Lawler’s decomposition rule and leads to a new double decomposition procedure. This procedure is embedded into a branch and bound method which applies a new lower bound based on due dates reassignment. The branch and bound method is tested on problems with size up to 150 jobs.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
31
Citations
NaN
KQI