.png){kind=icon}
Return
Solution algorithms for the makespan minimization problem with the general learning model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2008.07.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most of the papers devoted to scheduling problems with the learning effect concern the Wright's learning curve. On the other hand, the study about learning has pointed out that the learning curve in practice is very often an S-shaped function, which has not been considered in scheduling. Thus, in this paper, a single processor makespan minimization problem with an S-shaped learning model is investigated. We prove that this problem is strongly NP-hard even if the experience provided by each job is equal to its normal processing time. Therefore, to solve this problem, we prove some eliminating properties that are used to construct a branch and bound algorithm and some fast heuristic methods. Since the proposed algorithms are dedicated for the general case, i.e., where job processing times are arbitrary non-increasing experience dependent functions, their efficiency is verified numerically for the S-shaped model. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Learning effect
Single processor
Computational complexity
Branch and bound
Heuristic
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
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
ShareSave
View more