Scheduling with State-Dependent Machine Speed

V.M. Timmermans; T. Vredeveld

doi:10.1007/978-3-319-28684-6_17

Scheduling with State-Dependent Machine Speed

^*Corresponding author for this work

Quantitative Economics

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

We study a preemptive single machine scheduling problem where the machine speed is externally given and depends on the number unfinished jobs. The objective is to minimize the sum of weighted completion times. We develop a greedy algorithm that solves the problem to optimality when we work with either unit weights or unit processing times. If both weights and processing times are arbitrary, we show the problem is NP-hard by making a reduction from 3-partition.

Original language	English
Title of host publication	Approximation and Online Algorithms. WAOA 2015
Editors	L. Sanità, M. Skutella
Publisher	Springer, Cham
Pages	196–208
ISBN (Electronic)	978-3-319-28684-6
ISBN (Print)	978-3-319-28683-9
DOIs	https://doi.org/10.1007/978-3-319-28684-6_17
Publication status	Published - 2015
Event	13th Workshop on Approximation and Online Algorithms - Patras, Greece, Patras, Greece Duration: 17 Sept 2015 → 18 Sept 2015 http://algo2015.upatras.gr/waoa/index.html

Publication series

Series	Lecture Notes in Computer Science
Volume	9499
ISSN	0302-9743

Workshop

Workshop	13th Workshop on Approximation and Online Algorithms
Abbreviated title	WAOA 2015
Country/Territory	Greece
City	Patras
Period	17/09/15 → 18/09/15
Internet address	http://algo2015.upatras.gr/waoa/index.html

Access to Document

10.1007/978-3-319-28684-6_17

Cite this

@inproceedings{62de865d21b740639e7b0acd90774138,

title = "Scheduling with State-Dependent Machine Speed",

abstract = "We study a preemptive single machine scheduling problem where the machine speed is externally given and depends on the number unfinished jobs. The objective is to minimize the sum of weighted completion times. We develop a greedy algorithm that solves the problem to optimality when we work with either unit weights or unit processing times. If both weights and processing times are arbitrary, we show the problem is NP-hard by making a reduction from 3-partition.",

author = "V.M. Timmermans and T. Vredeveld",

note = "Scheduling with State-Dependent Machine Speed ; 13th Workshop on Approximation and Online Algorithms, WAOA 2015 ; Conference date: 17-09-2015 Through 18-09-2015",

year = "2015",

doi = "10.1007/978-3-319-28684-6_17",

language = "English",

isbn = "978-3-319-28683-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

pages = "196–208",

editor = "L. Sanit{\`a} and M. Skutella",

booktitle = "Approximation and Online Algorithms. WAOA 2015",

address = "Switzerland",

url = "http://algo2015.upatras.gr/waoa/index.html",

}

Scheduling with State-Dependent Machine Speed. / Timmermans, V.M.; Vredeveld, T.
Approximation and Online Algorithms. WAOA 2015. ed. / L. Sanità; M. Skutella. Springer, Cham, 2015. p. 196–208 (Lecture Notes in Computer Science, Vol. 9499).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - Scheduling with State-Dependent Machine Speed

AU - Timmermans, V.M.

AU - Vredeveld, T.

N1 - Scheduling with State-Dependent Machine Speed

PY - 2015

Y1 - 2015

N2 - We study a preemptive single machine scheduling problem where the machine speed is externally given and depends on the number unfinished jobs. The objective is to minimize the sum of weighted completion times. We develop a greedy algorithm that solves the problem to optimality when we work with either unit weights or unit processing times. If both weights and processing times are arbitrary, we show the problem is NP-hard by making a reduction from 3-partition.

AB - We study a preemptive single machine scheduling problem where the machine speed is externally given and depends on the number unfinished jobs. The objective is to minimize the sum of weighted completion times. We develop a greedy algorithm that solves the problem to optimality when we work with either unit weights or unit processing times. If both weights and processing times are arbitrary, we show the problem is NP-hard by making a reduction from 3-partition.

U2 - 10.1007/978-3-319-28684-6_17

DO - 10.1007/978-3-319-28684-6_17

M3 - Conference article in proceeding

SN - 978-3-319-28683-9

T3 - Lecture Notes in Computer Science

SP - 196

EP - 208

BT - Approximation and Online Algorithms. WAOA 2015

A2 - Sanità, L.

A2 - Skutella, M.

PB - Springer, Cham

T2 - 13th Workshop on Approximation and Online Algorithms

Y2 - 17 September 2015 through 18 September 2015

ER -

Scheduling with State-Dependent Machine Speed

Abstract

Publication series

Workshop

Access to Document

Fingerprint

Cite this