Journal
JOURNAL OF MANUFACTURING SYSTEMS
Volume 34, Issue -, Pages 60-65Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2014.11.001
Keywords
Scheduling; Time-dependent; Learning effect; Upper bound
Categories
Funding
- Humanities and Social Science Fund of Ministry of Education in China [11YJCZH019]
- Humanities and Social Science Research Base of Major Projects of Guangdong Province Universities [11jdxm63001]
- NSFC [71271060]
- GDNSF [S2012010009278, S2012040007286]
Ask authors/readers for more resources
In this paper, we introduce a single-machine scheduling problem with an exponentially time-dependent learning effect. The processing time of a job is assumed to be an exponential function of the total normal processing time of jobs already processed before it. For such a scheduling problem, we first provide the upper bound for the maximum lateness and for the total weighted completion time. Next, we show that problems with the following criteria: makespan, the total completion time, the total weighted completion time, the total earliness/tardiness penalties and the maximum lateness under some agreeable conditions, are polynomially solvable. (C) 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available