Heuristics for scheduling problems with an unavailability constraint and position‐dependent processing times

We study a single machine scheduling problem, where the machine is unavailable for processing for a pre‐specified time period. We assume that job processing times are position‐dependent. The objective functions considered are minimum makespan, minimum total completion time and minimum number of tardy jobs. All these problems are known to be NP‐hard even without position‐dependent processing times. For all three cases we introduce simple heuristics which are based on solving the classical assignment problem. Lower bounds, worst case analysis and asymptotic optimality are discussed. All heuristics are shown numerically to perform extremely well.