We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
SINGLE-MACHINE RESCHEDULING PROBLEMS WITH LEARNING EFFECT UNDER DISRUPTIONS.
- Authors
Cheng, Mingbao; Xiao, Shuxian; Liu, Guosheng
- Abstract
Rescheduling in production planning means to schedule the sequenced jobs again together with a set of new arrived jobs so as to generate a new feasible schedule, which creates disruptions to any job between the original and adjusted position. In this paper, we study rescheduling problems with learning effect under disruption constraints to minimize several classical objectives, where learning effect means that the workers gain experience during the process of operation and make the actual processing time of jobs shorter than their normal processing time. The objectives are to find optimal sequences to minimize the makespan and the total completion time under a limit of the disruptions from the original schedule. For the considered objectives under a single disruption constraint or a disruption cost constraint, we propose polynomial-time algorithms and pseudo-polynomial time algorithms, respectively.
- Subjects
PRODUCTION planning; OCCUPATIONS; PRODUCTION scheduling; LEARNING; POLYNOMIAL time algorithms
- Publication
Journal of Industrial & Management Optimization, 2018, Vol 14, Issue 3, p967
- ISSN
1547-5816
- Publication type
Article
- DOI
10.3934/jimo.2017085