Scheduling unit-time tasks in renewable resource constrained flowshops

In this paper the authors address the problem of scheduling unit time jobs in a flowshop to minimize makespan under a discrete renewable resource constraint. They propose algorithms having complexity O(n) for special cases of two machine and three machine problems. For the three machine NP-hard problem the authors develop a branch and bound procedure and several upper and lower bounds. They test the efficiency of the procedure and report the present computational experience.