%0 Conference Proceedings
%T Multi-machine Scheduling with Setup Times
%+ Faculty of Electronics and Information Technology
%+ Witelon State University of Applied Sciences in Legnica
%+ University of Wrocław [Poland] (UWr)
%A Bożejko, Wojciech
%A Kacprzak, Łukasz
%A Nadybski, Piotr
%A Wodecki, Mieczysław
%Z Part 5: Scheduling in Manufacturing and Other Applications
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 300-311
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_27
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637475/document
%2 https://inria.hal.science/hal-01637475/file/419526_1_En_27_Chapter.pdf
%L hal-01637475
%U https://inria.hal.science/hal-01637475
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842