42 An Algorithm for Determining the Optimal Waiting Times in Machine Scheduling Problem Available to Purchase

In this paper, we consider the problem of determining the optimal real waiting times in single machine with a set of given operation sequences and dependent time windows. This problem typically arises in the manufacturing environment where next operation has to be carried out within a time interval after the completion of its immediate predecessors. The objective is to minimize the makespan. In this paper, we introduce a polynomial time algorithm that solves this problem in $O(n2)$, where n stands for the total number of operations in a schedule.