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 |
Issue Date: | Nov-2005 | Source: | Computers and 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. | Keywords: | Flowshop scheduling Job class setups Heuristics Branch-and-bound algorithms Total flowtime |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | 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 | Size | Format | |
---|---|---|---|---|
(Revised)TwoMachineFlowshopSchedulingJobClassSetup.pdf | Pre-published version | 421.47 kB | Adobe PDF | View/Open |
Page views
117
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
198
Citations as of Apr 21, 2024
SCOPUSTM
Citations
16
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
15
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.