Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/152
Title: Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Authors: Cheng, TCE 
Wu, CC
Lee, WC
Keywords: Scheduling
Learning effect
Single-machine
Flowshop
Issue Date: 1-Jun-2008
Publisher: Elsevier
Source: Information sciences, June 2008, v. 178, no. 11, p.2476-2487 How to cite?
Journal: Information sciences 
Abstract: In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job's scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. Finally, we present polynomial-time optimal solutions for some special cases of the m-machine flowshop problems to minimize makespan and total completion time.
URI: http://hdl.handle.net/10397/152
ISSN: 0020-0255
DOI: 10.1016/j.ins.2008.02.002
Rights: Information Sciences © 2008 Elsevier Science 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 
INS-D-07-724R1 Final Version.pdfPre-published version149 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

118
Last Week
1
Last month
1
Citations as of Jun 8, 2016

WEB OF SCIENCETM
Citations

110
Last Week
0
Last month
0
Citations as of Jul 22, 2016

Page view(s)

300
Last Week
0
Last month
Checked on Jul 24, 2016

Download(s)

625
Checked on Jul 24, 2016

Google ScholarTM

Check

Altmetric



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