An exponential neighbourhood for a one-machine batching problem

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)
2 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)461-476
Number of pages16
JournalOR Spectrum = OR Spektrum
Issue number4
Publication statusPublished - Oct 1999


  • MSC-90B35


Dive into the research topics of 'An exponential neighbourhood for a one-machine batching problem'. Together they form a unique fingerprint.

Cite this