The flow shop problem with time lags and separated setup times

This paper generalizes Khurana-Bagga's flow-shop model which involves separated setup times and time lags where no restrictions are imposed on the processing and setup times as well as start and stop lags. It solves the two machine case and provides and approximate solution for the multimachine case. It also shows that Khurana-Bagga's algorithm is restricted to a special case of the two machine problem.