@article{Wang1997MinimizingMI,
title={Minimizing Makespan in a Class of Reentrant Shops},
author={M. Wang and S. Sethi and S. Velde},
journal={Oper. Res.},
year={1997},
volume={45},
pages={702-712}
}

We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule the jobs so as to minimize the makespan. This problem is unary NP-hard for a general number of machines. We focus in particular on the two-machine case that is also at least binary NP-hard. We prove some… Expand