Makespan minimization for two parallel machines with unavailability constraints

Abstract

This paper considers the two-parallel-machine scheduling problem with precedence constraints. One of the machines may not always be available due to machine breakdowns or preventive maintenance during the scheduling period. All execution and communication times between tasks are considered unitary and all unavailability dates are known in advance. The… (More)
DOI: 10.1109/SMC.2016.7844306

Topics

1 Figure or Table

Slides referencing similar topics