Please use this identifier to cite or link to this item:
Title: Two-machine flowshop scheduling with job class setups to minimize total flowtime
Authors: Wang, Xiuli
Cheng, T. C. Edwin
Subjects: Flowshop scheduling
Job class setups
Branch-and-bound algorithms
Total flowtime
Issue Date: Nov-2005
Publisher: Elsevier
Source: Computers & operations research, Nov. 2005, v. 32, no. 11, p. 2751-2770.
Abstract: This paper studies the two-machine flowshop scheduling problem with job class setups to minimize the total flowtime. The jobs are classified into classes, and a setup is required on a machine if it switches processing of jobs from one class to another class, but no setup is required if the jobs are from the same class. For some special cases, we derive a number of properties of the optimal solution, based on which we design heuristics and branch-and-bound algorithms to solve these problems. Computational results show that these algorithms are effective in yielding near-optimal or optimal solutions to the tested 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.04.002
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
(Revised)TwoMachineFlowshopSchedulingJobClassSetup.pdfPre-published version421.47 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.