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
StatePublished - Oct 1999

Keywords

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

Cite this

Hurink, Johann L. / An exponential neighbourhood for a one-machine batching problem.

Vol. 21, No. 4, 10.1007/s002910050098, 10.1999, p. 461-476.

Research output: Scientific - peer-reviewArticle

@article{dac03ac975e047de92bb3655e9a1f02b,
title = "An exponential neighbourhood for a one-machine batching problem",
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.",
keywords = "MSC-90B35, METIS-140573, IR-63583, EWI-7588",
author = "Hurink, {Johann L.}",
year = "1999",
month = "10",
doi = "10.1007/s002910050098",
volume = "21",
pages = "461--476",
number = "4",

}

Hurink, JL 1999, 'An exponential neighbourhood for a one-machine batching problem' vol 21, no. 4, 10.1007/s002910050098, pp. 461-476. DOI: 10.1007/s002910050098

An exponential neighbourhood for a one-machine batching problem. / Hurink, Johann L.

Vol. 21, No. 4, 10.1007/s002910050098, 10.1999, p. 461-476.

Research output: Scientific - peer-reviewArticle

TY - JOUR

T1 - An exponential neighbourhood for a one-machine batching problem

AU - Hurink,Johann L.

PY - 1999/10

Y1 - 1999/10

N2 - 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.

AB - 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.

KW - MSC-90B35

KW - METIS-140573

KW - IR-63583

KW - EWI-7588

U2 - 10.1007/s002910050098

DO - 10.1007/s002910050098

M3 - Article

VL - 21

SP - 461

EP - 476

IS - 4

M1 - 10.1007/s002910050098

ER -

Hurink JL. An exponential neighbourhood for a one-machine batching problem. 1999 Oct;21(4):461-476. 10.1007/s002910050098. Available from, DOI: 10.1007/s002910050098