An exponential neighbourhood for a one-machine batching problem

Share/Save/Bookmark

Hurink, Johann (1999) An exponential neighbourhood for a one-machine batching problem. OR Spectrum, 21 (4). pp. 461-476. ISSN 0171-6468

[img] PDF - Published Version
Restricted to UT campus only
: Request a copy
131kB
Abstract: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.
Item Type:Article
Copyright:© 1999 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63583
Official URL:http://dx.doi.org/10.1007/s002910050098
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140573