Please use this identifier to cite or link to this item:
Title: Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time
Authors: Cheng, TCE 
Ng, CTD 
Yuan, JJ
Keywords: Scheduling
Single machine
Multi-operation jobs
Job-batch restriction
Issue Date: 1-Dec-2008
Publisher: Elsevier B.V.
Source: European journal of operational research, 1 Dec. 2008, v. 191, no. 2, p. 320-331 How to cite?
Journal: European journal of operational research 
Abstract: We consider the problem of scheduling multi-operation jobs on a singe machine to minimize the total completion time. Each job consists of several operations that belong to different families. In a schedule each family of job operations may be processed as batches with each batch incurring a set-up time. A job is completed when all of its operations have been processed. We first show that the problem is strongly NP-hard even when the set-up times are common and each operation is not missing. When the operations have identical processing times and either the maximum set-up time is sufficiently small or the minimum set-up time is sufficiently large, the problem can be solved in polynomial time. We then consider the problem under the job-batch restriction in which the operations of each batch is partitioned into operation batches according to a partition of the jobs. We show that this case of the problem can be solved in polynomial time under a certain condition.
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.08.019
Rights: European Journal of Operational Research © 2007 Elsevier B.V. The journal web site is located at
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Assembly_without(REVISED)_Final.pdfPre-published version178.31 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 4, 2016


Citations as of Feb 6, 2016

Page view(s)

Checked on Jan 31, 2016

Google ScholarTM



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