Please use this identifier to cite or link to this item:
Title: A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups
Authors: Wang, Xiuli
Cheng, T. C. Edwin
Subjects: Flowshop scheduling
Job class setups
Maximum lateness
Issue Date: May-2006
Publisher: Elsevier Ltd.
Source: Computers & operations research, May 2006, v. 33, no. 5, p. 1326-1344.
Abstract: This paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness. The jobs are divided into job classes and a setup is required at the initial processing of a job or between the processing of jobs of different classes. In a no-wait environment, a job must be processed from start to finish without interruptions on a machine or between the machines. A batch is a maximal subset of consecutively processed jobs of the same class. Several properties concerning the beneficial merging of batches and some dominance rules that improve the objective function are derived. Since the problem is NP-hard, a heuristic is proposed and evaluated computationally. The numerical results demonstrate that the heuristic can produce near-optimal solutions quickly for realistic-sized problems.
Rights: Computers & Operations Research © 2004 Elsevier Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.cor.2004.09.018
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
AheuristicApproachForNo_waitFlowshop.pdfPre-published version491.23 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.