Some Comments on Sequencing with Controllable Processing Times

H. Hoogeveen; G.J. Woeginger

doi:10.1007/s00607-001-1441-x

Some Comments on Sequencing with Controllable Processing Times

H. Hoogeveen, G.J. Woeginger

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

46 Citations (Scopus)

Abstract

We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.

Original language	English
Pages (from-to)	181-192
Journal	Computing
Volume	68
DOIs	https://doi.org/10.1007/s00607-001-1441-x
Publication status	Published - 2002
Externally published	Yes

Keywords

METIS-208611

Access to Document

10.1007/s00607-001-1441-x

Cite this

@article{b2df6eb122ae47a0bd26d9a3da189b3a,

title = "Some Comments on Sequencing with Controllable Processing Times",

abstract = "We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.",

keywords = "METIS-208611",

author = "H. Hoogeveen and G.J. Woeginger",

year = "2002",

doi = "10.1007/s00607-001-1441-x",

language = "English",

volume = "68",

pages = "181--192",

journal = "Computing",

issn = "0010-485X",

publisher = "Springer",

}

TY - JOUR

T1 - Some Comments on Sequencing with Controllable Processing Times

AU - Hoogeveen, H.

AU - Woeginger, G.J.

PY - 2002

Y1 - 2002

N2 - We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.

AB - We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.

KW - METIS-208611

U2 - 10.1007/s00607-001-1441-x

DO - 10.1007/s00607-001-1441-x

M3 - Article

VL - 68

SP - 181

EP - 192

JO - Computing

JF - Computing

SN - 0010-485X

ER -

Some Comments on Sequencing with Controllable Processing Times

Abstract

Keywords

Access to Document

Fingerprint

Cite this