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 properties that identify a specific class of optimal schedules, and then use these properties in designing an approximation algorithm and a branch-and-bound type optimization algorithm. The approximation algorithm, of which we present three versions, has a worst-case performance guarantee of &frac;32 along with an excellent empirical performance. The optimization algorithm solves large instances quickly. Finally, we identify a few well solvable special cases and present a pseudo-polynomial algorithm for the case in which the first and the last operations of any job (on the primary machine) are identical.

Additional Metadata
Keywords approximation theory, job performance, machienery, mathematical optimization, occupations (classifications), production scheduling, stores (retail)
Persistent URL hdl.handle.net/1765/12342
Citation
Wang, M., Sethi, S., & van de Velde, S.L.. (1997). Scheduling a batching machine. Operations Research, 702–712. Retrieved from http://hdl.handle.net/1765/12342