A new lower bound approach for single-machine multicriteria scheduling

J.A. Hoogeveen; S.L. van de Velde

doi:10.1016/0167-6377(92)90060-G

A new lower bound approach for single-machine multicriteria scheduling

J.A. Hoogeveen, S.L. van de Velde

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

3 Citations (Scopus)

100 Downloads (Pure)

Abstract

The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality.

Original language	English
Pages (from-to)	39-44
Number of pages	5
Journal	Operations research letters
Volume	0
Issue number	11
DOIs	https://doi.org/10.1016/0167-6377(92)90060-G
Publication status	Published - 1992

Keywords

Single-machine scheduling
Multicriteria scheduling
Maximum potential improvement
Objective splitting

Access to Document

10.1016/0167-6377(92)90060-G

Velde92newFinal published version, 429 KB

Cite this

@article{99d27fedb49542d08e1746f3182f6535,

title = "A new lower bound approach for single-machine multicriteria scheduling",

abstract = "The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality.",

keywords = "Single-machine scheduling, Multicriteria scheduling, Maximum potential improvement, Objective splitting",

author = "J.A. Hoogeveen and {van de Velde}, S.L.",

year = "1992",

doi = "10.1016/0167-6377(92)90060-G",

language = "English",

volume = "0",

pages = "39--44",

journal = "Operations research letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - A new lower bound approach for single-machine multicriteria scheduling

AU - Hoogeveen, J.A.

AU - van de Velde, S.L.

PY - 1992

Y1 - 1992

N2 - The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality.

AB - The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality.

KW - Single-machine scheduling

KW - Multicriteria scheduling

KW - Maximum potential improvement

KW - Objective splitting

U2 - 10.1016/0167-6377(92)90060-G

DO - 10.1016/0167-6377(92)90060-G

M3 - Article

SN - 0167-6377

VL - 0

SP - 39

EP - 44

JO - Operations research letters

JF - Operations research letters

IS - 11

ER -

A new lower bound approach for single-machine multicriteria scheduling

Abstract

Keywords

Access to Document

Fingerprint

Cite this