Permutation flowshop scheduling with time lag constraints and makespan criterion

A permutation flowshop with time lag constraints requires that the time lag between consecutive operations of a job must be in the given interval. In this study, the scheduling of such flowshop with makespan minimization objective is investigated. We prove that this problem has the reversibility property, and present a two-stage constructive heuristic with time complexity O(n 2 m), where n and m are the numbers of jobs and machines, …