Please use this identifier to cite or link to this item:
Title: Some scheduling problems with deteriorating jobs and learning effects
Authors: Cheng, T. C. Edwin
Wu, Chin-chia
Lee, Wen-chiung
Subjects: Scheduling
Learning effect
Deteriorating jobs
Single machine
Issue Date: May-2008
Publisher: Elsevier
Source: Computers & industrial engineering, May 2008, v. 54, no. 4, p. 972-982.
Abstract: Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper, we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. For the single-machine case, we derive polynomial-time optimal solutions for the problems to minimize makespan and total completion time. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. For the case of an m-machine permutation flowshop, we present polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time.
Rights: Computers & Industrial Engineering © 2008 Elsevier Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.cie.2007.11.006
ISSN: 0360-8352
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
CAIE07317R1.pdfPre-published version155.61 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.