An exponential neighbourhood for a one-machine batching problem

Johann Hurink

doi:10.1007/s002910050098

An exponential neighbourhood for a one-machine batching problem

Johann Hurink

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

18 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 language	English
Pages (from-to)	461-476
Number of pages	16
Journal	OR Spectrum = OR Spektrum
Volume	21
Issue number	4
DOIs	https://doi.org/10.1007/s002910050098
Publication status	Published - Oct 1999

Keywords

MSC-90B35

Access to Document

10.1007/s002910050098

Cite this

@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",

author = "Johann Hurink",

year = "1999",

month = oct,

doi = "10.1007/s002910050098",

language = "English",

volume = "21",

pages = "461--476",

journal = "OR Spectrum = OR Spektrum",

issn = "0171-6468",

publisher = "Springer",

number = "4",

}

TY - JOUR

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

AU - Hurink, Johann

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

U2 - 10.1007/s002910050098

DO - 10.1007/s002910050098

M3 - Article

VL - 21

SP - 461

EP - 476

JO - OR Spectrum = OR Spektrum

JF - OR Spectrum = OR Spektrum

SN - 0171-6468

IS - 4

ER -

An exponential neighbourhood for a one-machine batching problem

Abstract

Keywords

Access to Document

Fingerprint

Cite this