Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect
-
Published:2022-12-31
Issue:
Volume:
Page:1-14
-
ISSN:0129-0541
-
Container-title:International Journal of Foundations of Computer Science
-
language:en
-
Short-container-title:Int. J. Found. Comput. Sci.
Author:
Gao Jie1,
Zou Juan1ORCID,
Zhang Yuzhong2
Affiliation:
1. School of Mathematical Sciences, Qufu Normal University, Qufu 273165, P. R. China
2. Institute of Operation Research, Qufu Normal University, Rizhao 276826, P. R. China
Abstract
In this paper, we study the single-machine scheduling problems with DeJong’s learning effect and deteriorating maintenance activity, where DeJong’s learning effect is a special position-based learning effect and the duration of the deteriorating maintenance activity is a linear increasing function of its starting time. Our goal is to determine the job sequence of all jobs and the position of the maintenance activity to minimize some performance measures. When the performance measures are the makespan and the total completion time, we show that both of them can be solved in polynomial time. When the performance measure is the total weighted completion time, we develop a pseudo-polynomial time dynamic programming algorithm under a special case. When the performance measure is the maximum lateness, we show that the earliest due date first (EDD) order is a bad algorithm for the general case, and develop a polynomial time algorithm under a special case.
Funder
National Natural Science Foundation of China
Shandong Provincial Natural Science Foundation
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Science (miscellaneous)