An exponential neighbourhood for a one-machine batching problem

Research output: Book/ReportReportProfessional

63 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente
Number of pages19
ISBN (Print)0169-2690
Publication statusPublished - 1998

Publication series

NameMemorandum / Faculty of Mathematical Sciences, University of Twente, ISSN 0921-1969 ; no. 1449
PublisherUniversiteit Twente


  • EWI-3269
  • METIS-141265
  • IR-30624
  • MSC-90B35

Cite this