Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9875
Title: Single Machine Scheduling with Learning Effect Considerations
Authors: Cheng, TCE 
Wang, G
Keywords: Learning
Scheduling
Sequencing
Issue Date: 2000
Publisher: Springer
Source: Annals of operations research, 2000, v. 98, no. 1-4, p. 273-290 How to cite?
Journal: Annals of operations research 
Abstract: In this paper we study a single machine scheduling problem in which the job processing times will decrease as a result of learning. A volume-dependent piecewise linear processing time function is used to model the learning effects. The objective is to minimize the maximum lateness. We first show that the problem is NP-hard in the strong sense and then identify two special cases which are polynomially solvable. We also propose two heuristics and analyse their worst-case performance.
URI: http://hdl.handle.net/10397/9875
ISSN: 0254-5330
EISSN: 1572-9338
DOI: 10.1023/A:1019216726076
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

222
Last Week
3
Last month
2
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

204
Last Week
1
Last month
1
Citations as of Aug 21, 2017

Page view(s)

51
Last Week
2
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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