Brucker, P and Shakhlevich, NV (2011) A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. Journal of Scheduling, 14 (4). 371 - 389. ISSN 1094-6136
Abstract
A flow-shop batching problem with consistent batches is considered in which the processing times of all jobs on each machine are equal to p and all batch set-up times are equal to s. In such a problem, one has to partition the set of jobs into batches and to schedule the batches on each machine. The processing time of a batch B i is the sum of processing times of operations in B i and the earliest start of B i on a machine is the finishing time of B i on the previous machine plus the set-up time s. Cheng et al. (Naval Research Logistics 47:128–144, 2000) provided an O(n) pseudopolynomial-time algorithm for solving the special case of the problem with two machines. Mosheiov and Oron (European Journal of Operational Research 161:285–291, 2005) developed an algorithm of the same time complexity for the general case with more than two machines. Ng and Kovalyov (Journal of Scheduling 10:353–364, 2007) improved the pseudopolynomial complexity to O(n √ ) . In this paper, we provide a polynomial-time algorithm of time complexity O(log 3 n).
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2011 Sprginer. This is an author produced version of a paper published in Journal of Scheduling. Reproduced in accordance with the publisher's self-archiving policy. The final publication is available at Springer via http://dx.doi.org/10.1007/s10951-009-0150-8 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 08 Dec 2014 10:13 |
Last Modified: | 16 Jan 2018 00:09 |
Published Version: | http://dx.doi.org/10.1007/s10951-009-0150-8 |
Status: | Published |
Publisher: | Springer |
Refereed: | Yes |
Identification Number: | 10.1007/s10951-009-0150-8 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:81535 |