Effective algorithms for scheduling problems under non-availability constraints (Invited paper)

In this paper, we consider some practical scheduling problems under unavailability constraints (break-down periods, maintenance durations and/or setup times). Such problems can be met in different industrial environments and be associated to numerous real-life applications. The studied criteria are related to the maximum lateness minimization. The paper is organized in two main parts. The first part focuses on some special cases (makespan minimization when tails are equal and maximum lateness minimization when release dates are equal (see Section 2). The second part is devoted to the maximum lateness minimization (see Section 3). In each part, we present the main contributions and explain their principles (complexity results, heuristic algorithms and their worst-case performance, existing approximation schemes, exact methods, dynamic programming,...), Finally, Section 4 concludes the paper.