Flow shop scheduling problems with decreasing linear deterioration under dominant machines
In this paper, the author considers the general no-wait and no-idle flow shop scheduling problems with deteriorating jobs under dominant machines, where the no-wait constraint means that each job once started has to be processed without interruption until all of its operations are completed and the no-idle contraint means that each machine once it starts ists work has to process all operations assigned to it without any interruption. It is described a polynomial time algorithm for minimizing the makespan that provides the optimal solution within \(O(mn)\), where \(m\) is the number of machines and \(n\) is the number of jobs. The author shows that when the objective is to minimize the maximum lateness (tardiness) of a job, the solutions of a classical method may not hold.
scientific article; zbMATH DE number 5128193
scientific article