Article contents
An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗
Published online by Cambridge University Press: 11 February 2013
Abstract
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2013
References
Références
- 4
- Cited by