Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13888
Title: Makespan minimization in the two-machine flowshop batch scheduling problem
Authors: Cheng, TCE 
Lin, BMT
Toker, A
Issue Date: 2000
Publisher: John Wiley & Sons
Source: Naval research logistics, 2000, v. 47, no. 2, p. 128-144 How to cite?
Journal: Naval research logistics 
Abstract: In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP-hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics.
URI: http://hdl.handle.net/10397/13888
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/(SICI)1520-6750(200003)47:2<128
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

44
Last Week
0
Last month
Citations as of Nov 11, 2017

Page view(s)

55
Last Week
3
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.