Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects

Abstract

In this paper, the single-machine scheduling problems under the common and slack due date assignments are studied, where the actual processing time of the job needs to consider some factors, such as convex resource allocation, maintenance activity, and learning effects. The goal of this study is to find the optimal sequence, maintenance activity location, resource allocation and common due date (flow allowance). The objective function is (1) to minimize the sum of scheduling cost (including the weighted sum of earliness, tardiness and common due date (flow allowance), where the weights are position-dependent weights) and resource consumption cost, and (2) to minimize the scheduling cost under the resource consumption cost which is bounded. We prove that these problems can be solved in polynomial time.

Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties

“…In addition, a variation of the OTM-AP is to minimize the maximum processing time of the machines. This problem and other related problems have been considered extensively in the literature [14][15][16][17].…”