.png){kind=icon}
Return
Some single-machine scheduling problems with a truncation learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.01.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called sum-of processing-times-based learning in which the actual processing time of a job is a non-increasing function of the jobs already processed. However, the actual processing time of a given job drops to zero precipitously when the normal job processing times are large. Motivated by this observation, we propose a truncation learning model where the actual job processing time is a function which depends not only on the processing times of the jobs already processed but also on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. Under the proposed learning model, we show that some single-machine scheduling problems can be solved in polynomial time. In addition, we further provide the worst-case error bounds for the problems to minimize the maximum lateness and total weighted completion time. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Single-machine
Truncation learning effect
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveScheduling problems with deteriorating jobs and learning effects including proportional setup times
PREAI
ShareSaveShareSave View more