Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29860
Title: Batching and scheduling in a multi-machine flow shop
Authors: Ng, CT 
Kovalyov, MY
Keywords: Batching
Dynamic programming
Flow shop
Scheduling
Issue Date: 2007
Publisher: Springer
Source: Journal of scheduling, 2007, v. 10, no. 6, p. 353-364 How to cite?
Journal: Journal of scheduling 
Abstract: We study the problem of batching and scheduling n jobs in a flow shop comprising m, m2, machines. Each job has to be processed on machines 1,m in this order. Batches are formed on each machine. A machine dependent setup time precedes the processing of each batch. Jobs of the same batch are processed on each machine sequentially so that the processing time of a batch is equal to the sum of the processing times of the jobs contained in it. Jobs of the same batch formed on machine l become available for a downstream operation on machine l+1 at the same time when the processing of the last job of the batch on machine l has been finished. The objective is to minimize maximum job completion time. We establish several properties of an optimal schedule and develop polynomial time algorithms for important special cases. They are improvements over the existing methods with regard to their generality and time efficiency.
URI: http://hdl.handle.net/10397/29860
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-007-0041-9
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Oct 9, 2017

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
0
Citations as of Oct 15, 2017

Page view(s)

80
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.