Note: Open shop scheduling with release dates to minimize maximum lateness

H. Kellerer; T. Tautenhahn; G.J. Woeginger

doi:10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3

Note: Open shop scheduling with release dates to minimize maximum lateness

H. Kellerer, T. Tautenhahn, G.J. Woeginger

Stochastic Operations Research

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

2 Citations (Scopus)

1 Downloads (Pure)

Abstract

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness

Original language	English
Pages (from-to)	141-145
Journal	Naval Research Logistics
Volume	42
Issue number	1
DOIs	https://doi.org/10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3
Publication status	Published - 1995

Access to Document

10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3

Cite this

@article{f461db58c4bc4d8198f1e90035169673,

title = "Note: Open shop scheduling with release dates to minimize maximum lateness",

abstract = "We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness",

author = "H. Kellerer and T. Tautenhahn and G.J. Woeginger",

year = "1995",

doi = "10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3",

language = "English",

volume = "42",

pages = "141--145",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "Wiley",

number = "1",

}

TY - JOUR

T1 - Note: Open shop scheduling with release dates to minimize maximum lateness

AU - Kellerer, H.

AU - Tautenhahn, T.

AU - Woeginger, G.J.

PY - 1995

Y1 - 1995

N2 - We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness

AB - We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness

U2 - 10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3

DO - 10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3

M3 - Article

SN - 0894-069X

VL - 42

SP - 141

EP - 145

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 1

ER -

Note: Open shop scheduling with release dates to minimize maximum lateness

Abstract

Access to Document

Fingerprint

Cite this