Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities

ABSTRACT

This article considers a single machine scheduling problem with batch setups, positional deterioration effects, and multiple optional rate-modifying activities to minimize the total completion time. This problem is formulated as an integer quadratic programming problem. In view of the complexity of optimally solving this problem, a two-phase heuristic algorithm is proposed where an optimal but non-integer solution is obtained in the first phase by solving a continuous relaxed version of the problem. This solution serves as a lower bound for the optimal value of the total completion time. The second phase of the algorithm generates an integer solution using a simple rounding scheme that is optimum or very close to optimum for this problem. Empirical evaluation and comparison with an existing heuristic algorithm show that the proposed heuristic algorithm is substantially more effective in solving large-size problem instances.

KEYWORDS:

• Single machine scheduling with batch setups
• unit processing times
• positional deterioration effects
• rate-modifying maintenance activities
• total completion time

Disclosure statement

No potential conflict of interest was reported by the authors.