| Article ID: | iaor20002096 |
| Country: | Germany |
| Volume: | 21 |
| Issue: | 4 |
| Start Page Number: | 461 |
| End Page Number: | 476 |
| Publication Date: | Jan 1999 |
| Journal: | OR Spektrum |
| Authors: | Hurink J. |
In this paper we consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We develop an exponential neighborhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.