Scheduling flexible flowshops with unit-time operations and minimum time delays

In this paper, we consider the flexible flowshop problem with unit-time operations and minimum time delays. We present two simple heuristic algorithms to solve this problem along with their worst-case analyses.