Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14243
Title: Single machine scheduling jobs with a truncated sum-of-processing-times-based learning effect
Authors: Li, L
Yang, SW
Wu, YB
Huo, Y
Ji, P 
Keywords: Learning effect
Scheduling
Single machine
Issue Date: 2013
Publisher: Springer
Source: International journal of advanced manufacturing technology, 2013, p. 1-7 How to cite?
Journal: International journal of advanced manufacturing technology 
Abstract: In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.
URI: http://hdl.handle.net/10397/14243
ISSN: 0268-3768
EISSN: 1433-3015
DOI: 10.1007/s00170-013-4772-9
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Sep 9, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Sep 21, 2017

Page view(s)

38
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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