An exponential neighbourhood for a one-machine batching problem

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)

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.
Original languageUndefined
Article number10.1007/s002910050098
Pages (from-to)461-476
Number of pages16
JournalOR Spectrum = OR Spektrum
Volume21
Issue number4
DOIs
Publication statusPublished - Oct 1999

Keywords

  • MSC-90B35
  • METIS-140573
  • IR-63583
  • EWI-7588

Cite this