Multi-machine Scheduling with Setup Times - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Multi-machine Scheduling with Setup Times

(1) , (1) , (2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
419526_1_En_27_Chapter.pdf (405.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01637475 , version 1 (17-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
71 View
72 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More