The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.
open-shop time delays makespan well solvable case worst-case analysis