%0 Generic
%A Vélez Gallego, Mario C.
%A Maya, Jairo
%A Montoya Torres, Jairo Rafael
%8 2016
%U http://hdl.handle.net/10818/36944
%X This paper considers the problem of scheduling a set of jobs subject to arbitrary release dates and sequence-dependent setup times on a single machine with the objective of minimizing the maximum completion of all the jobs, or makespan. This problem is often found in manufacturing processes such as painting and metalworking. A new mixed integer linear program (MILP) is firstly proposed. Because the problem is known to be NP-hard, a beam search heuristic is developed. Computational experiments are carried out using a well-known set of instances from the literature. Our results show that the proposed heuristic is effective in finding high quality solutions at low computational cost.
%I Computers & Operations Research
%T A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
%R 10.1016/j.cor.2016.04.009
%~ Intellectum