Article contents
On Minimizing Total Tardiness in a Serial Batching Problem
Published online by Cambridge University Press: 15 August 2002
Abstract
We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch | ∑Ti is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001
References
- 6
- Cited by