Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1153
Title: Two-machine flowshop scheduling with job class setups to minimize total flowtime
Authors: Wang, X
Cheng, TCE 
Keywords: Flowshop scheduling
Job class setups
Heuristics
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 How to cite?
Journal: Computers & operations research 
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.
URI: http://hdl.handle.net/10397/1153
ISSN: 0305-0548
DOI: 10.1016/j.cor.2004.04.002
Rights: Computers & Operations Research © 2004 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
(Revised)TwoMachineFlowshopSchedulingJobClassSetup.pdfPre-published version421.47 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of May 28, 2016

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of May 26, 2016

Page view(s)

314
Last Week
3
Last month
Checked on May 29, 2016

Download(s)

407
Checked on May 29, 2016

Google ScholarTM

Check

Altmetric



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