Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1141
Title: Two-machine flowshop batching and scheduling
Authors: Lin, BMT
Cheng, TCE 
Keywords: Production scheduling
Flowshop
Batch processing
Makespan
Strong NP-hardness
Lower bound
Heuristics
Issue Date: 2005
Publisher: Springer Netherlands
Source: Annals of operations research, Jan. 2005, v. 133, no. 1-4, p. 149-161 How to cite?
Journal: Annals of operations research 
Abstract: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The forming of each batch on the second machine incurs a constant setup time. The objective is to minimize the makespan. This problem was previously shown to be NP-hard in the ordinary sense. In this paper, we first present a strong NP-hardness result of the problem. We also identify a polynomially solvable case with either anticipatory or non-anticipatory setups. We then establish a property that an optimal solution for the special case is a lower bound for the general problem. To obtain near-optimal solutions for the general problem, we devise some heuristics. The lower bound is used to evaluate the quality of the heuristic solutions. Results of computational experiments reveal that the heuristics produce solutions with small error ratios. They also suggest that the lower bound is close to the optimal solution.
URI: http://hdl.handle.net/10397/1141
ISSN: 0254-5330 (print)
1572-9338 (online)
DOI: 10.1007/s10479-004-5029-7
Rights: © 2005 Springer Science + Business Media. The original publication is available at www.springerlink.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
ICOTA_AOR.pdfPre-published version148.89 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

19
Last Week
0
Last month
0
Citations as of Jun 5, 2016

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of Sep 24, 2016

Page view(s)

279
Last Week
0
Last month
Checked on Sep 25, 2016

Download(s)

789
Checked on Sep 25, 2016

Google ScholarTM

Check

Altmetric



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