In this paper we will consider a one-machine batching problem which is a combination of a sequencing and a partitioning problem. We will develop an exponential neighbourhood for this problem which can be evaluated in quadratic time using shortest path calculations. Results of a computational study are reported.
|Place of Publication||Enschede|
|Publisher||University of Twente|
|Number of pages||19|
|Publication status||Published - 1998|
|Name||Memorandum / Faculty of Mathematical Sciences, University of Twente, ISSN 0921-1969 ; no. 1449|