Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13269
Title: Batching and scheduling to minimize the makespan in the two-machine flowshop
Authors: Cheng, TCE 
Wang, G
Issue Date: 1998
Publisher: Taylor & Francis
Source: IIE transactions, 1998, v. 30, no. 5, p. 447-453 How to cite?
Journal: IIE transactions 
Abstract: In this paper, we consider a class of batching and scheduling problems in the two-machine flowshop where one of the machines is a discrete processor and the other one is a batch processor. The jobs are processed separately on the discrete processor and processed in batches on the batch processor. The processing time of a batch is equal to the total processing time of the jobs contained in it, and the completion time of a job in a batch is denned as the completion time of the batch containing it. A constant setup time is incurred whenever a batch is formed on the batch processor. The problem is to find the optimal batch compositions and the optimal schedule of the batches so that the makespan is minimized. All problems in this class are shown to be NP-complete in the ordinary sense. We also identify some polynomially solvable cases by introducing their corresponding solution methods.
URI: http://hdl.handle.net/10397/13269
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1080/07408179808966485
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

36
Last Week
0
Last month
0
Citations as of Nov 10, 2017

WEB OF SCIENCETM
Citations

29
Last Week
0
Last month
Citations as of Nov 16, 2017

Page view(s)

65
Last Week
0
Last month
Checked on Nov 20, 2017

Google ScholarTM

Check

Altmetric



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