Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan

Guido Passage; Marjan Van Den Akker; Han Hoogeveen

Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan

Guido Passage, Marjan Van Den Akker, Han Hoogeveen

Utrecht University

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

Abstract

We consider the problem of rinding a baseline schedule for stochastic planning problems with precedence relations. In such a situation it is hard to assess the quality of a move within a local search approach. It can be estimated using simulation, but this is slow. We present a new estimation method that is generally applicable and that is far more efficient than using simulation.

Original language	English
Title of host publication	PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling
Editors	Edmund K. Burke, Luca Di Gaspero, Barry McCollum, Nysret Musliu, Ender Ozcan
Publisher	PATAT
Pages	427-428
Number of pages	2
ISBN (Electronic)	9780992998424
Publication status	Published - 2018
Event	12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018 - Vienna, Austria Duration: 28 Aug 2018 → 31 Aug 2018

Publication series

Name	PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling

Conference

Conference	12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018
Country/Territory	Austria
City	Vienna
Period	28/08/18 → 31/08/18

Bibliographical note

Publisher Copyright:
© PATAT 2018 Organizing Committee.

Keywords

Local search
Normal distribution
Resource-constrained project scheduling
Stochastic planning

Cite this

Passage, G., Van Den Akker, M., & Hoogeveen, H. (2018). Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan. In E. K. Burke, L. Di Gaspero, B. McCollum, N. Musliu, & E. Ozcan (Eds.), PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 427-428). (PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling). PATAT.

Passage, Guido ; Van Den Akker, Marjan ; Hoogeveen, Han. / Local search for stochastic parallel machine scheduling : Improving performance by estimating the makespan. PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling. editor / Edmund K. Burke ; Luca Di Gaspero ; Barry McCollum ; Nysret Musliu ; Ender Ozcan. PATAT, 2018. pp. 427-428 (PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling).

@inproceedings{30e6f4bbd692470fa386715a343d352e,

title = "Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan",

abstract = "We consider the problem of rinding a baseline schedule for stochastic planning problems with precedence relations. In such a situation it is hard to assess the quality of a move within a local search approach. It can be estimated using simulation, but this is slow. We present a new estimation method that is generally applicable and that is far more efficient than using simulation.",

keywords = "Local search, Normal distribution, Resource-constrained project scheduling, Stochastic planning",

author = "Guido Passage and \{Van Den Akker\}, Marjan and Han Hoogeveen",

note = "Publisher Copyright: {\textcopyright} PATAT 2018 Organizing Committee.; 12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018 ; Conference date: 28-08-2018 Through 31-08-2018",

year = "2018",

language = "English",

series = "PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling",

publisher = "PATAT",

pages = "427--428",

editor = "Burke, \{Edmund K.\} and \{Di Gaspero\}, Luca and Barry McCollum and Nysret Musliu and Ender Ozcan",

booktitle = "PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling",

}

Passage, G, Van Den Akker, M & Hoogeveen, H 2018, Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan. in EK Burke, L Di Gaspero, B McCollum, N Musliu & E Ozcan (eds), PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling. PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling, PATAT, pp. 427-428, 12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018, Vienna, Austria, 28/08/18.

Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan. / Passage, Guido; Van Den Akker, Marjan ; Hoogeveen, Han.
PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling. ed. / Edmund K. Burke; Luca Di Gaspero; Barry McCollum; Nysret Musliu; Ender Ozcan. PATAT, 2018. p. 427-428 (PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling).

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

TY - GEN

T1 - Local search for stochastic parallel machine scheduling

T2 - 12th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2018

AU - Passage, Guido

AU - Van Den Akker, Marjan

AU - Hoogeveen, Han

N1 - Publisher Copyright: © PATAT 2018 Organizing Committee.

PY - 2018

Y1 - 2018

N2 - We consider the problem of rinding a baseline schedule for stochastic planning problems with precedence relations. In such a situation it is hard to assess the quality of a move within a local search approach. It can be estimated using simulation, but this is slow. We present a new estimation method that is generally applicable and that is far more efficient than using simulation.

AB - We consider the problem of rinding a baseline schedule for stochastic planning problems with precedence relations. In such a situation it is hard to assess the quality of a move within a local search approach. It can be estimated using simulation, but this is slow. We present a new estimation method that is generally applicable and that is far more efficient than using simulation.

KW - Local search

KW - Normal distribution

KW - Resource-constrained project scheduling

KW - Stochastic planning

UR - https://www.scopus.com/pages/publications/85085651024

M3 - Conference contribution

AN - SCOPUS:85085651024

T3 - PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling

SP - 427

EP - 428

BT - PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling

A2 - Burke, Edmund K.

A2 - Di Gaspero, Luca

A2 - McCollum, Barry

A2 - Musliu, Nysret

A2 - Ozcan, Ender

PB - PATAT

Y2 - 28 August 2018 through 31 August 2018

ER -

Passage G, Van Den Akker M , Hoogeveen H. Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan. In Burke EK, Di Gaspero L, McCollum B, Musliu N, Ozcan E, editors, PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling. PATAT. 2018. p. 427-428. (PATAT 2018 - Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling).

Local search for stochastic parallel machine scheduling: Improving performance by estimating the makespan

Abstract

Publication series

Conference

Bibliographical note

Keywords

Other files and links

Fingerprint

Cite this