A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (2009)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s10951-009-0150-8
Publication URI: http://dx.doi.org/10.1007/s10951-009-0150-8
Type: Journal Article/Review
Parent Publication: Journal of Scheduling
Issue: 4