Valid inequalities for a time-indexed formulation

L. Berghman; F.C.R. Spieksma

doi:10.1016/j.orl.2015.02.011

Valid inequalities for a time-indexed formulation

L. Berghman, F.C.R. Spieksma

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

3 Citations (Scopus)

1 Downloads (Pure)

Abstract

We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities

Original language	English
Pages (from-to)	268-272
Number of pages	5
Journal	Operations Research Letters
Volume	43
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2015.02.011
Publication status	Published - May 2015
Externally published	Yes

Keywords

Unrelated parallel machines
Valid inequalities
Separation

Access to Document

10.1016/j.orl.2015.02.011

Cite this

@article{adb8c1d29d0449a9a50e21469f2e1ce6,

title = "Valid inequalities for a time-indexed formulation",

abstract = "We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities",

keywords = "Unrelated parallel machines, Valid inequalities, Separation",

author = "L. Berghman and F.C.R. Spieksma",

year = "2015",

month = may,

doi = "10.1016/j.orl.2015.02.011",

language = "English",

volume = "43",

pages = "268--272",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Valid inequalities for a time-indexed formulation

AU - Berghman, L.

AU - Spieksma, F.C.R.

PY - 2015/5

Y1 - 2015/5

N2 - We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities

AB - We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities

KW - Unrelated parallel machines

KW - Valid inequalities

KW - Separation

U2 - 10.1016/j.orl.2015.02.011

DO - 10.1016/j.orl.2015.02.011

M3 - Article

SN - 0167-6377

VL - 43

SP - 268

EP - 272

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Valid inequalities for a time-indexed formulation

Abstract

Keywords

Access to Document

Fingerprint

Cite this