Skip to Main content Skip to Navigation
Conference papers

Multi-machine Scheduling with Setup Times

Abstract : In this paper we are considering the problem of tasks scheduling executed simultaneously on multiple identical machines with a cost-criterion, which is the product of the tasks execution time and the number of used machines. Moreover, it is assumed that between the tasks performed sequentially there must be setup of the machines performed. Solution to the problem comes down to a generalization of a two-dimensional packing problem. The paper presents simulated annealing algorithm with different variants of packing strategy. The conducted computational experiments proved that designated solution differs little from some lower bounds for the constraints of the objective function.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01637475
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 3:44:06 PM
Last modification on : Saturday, November 21, 2020 - 9:54:03 AM
Long-term archiving on: : Sunday, February 18, 2018 - 3:02:37 PM

File

419526_1_En_27_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Wojciech Bożejko, Łukasz Kacprzak, Piotr Nadybski, Mieczysław Wodecki. Multi-machine Scheduling with Setup Times. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.300-311, ⟨10.1007/978-3-319-45378-1_27⟩. ⟨hal-01637475⟩

Share

Metrics

Record views

139

Files downloads

189