id: 05694675
dt: a
an: 05694675
au: Kampke, Edmar Hell; Arroyo, José Elias Claudio; Santos, André Gustavo
ti: Iterated local search with path relinking for solving parallel machines
    scheduling problem with resource-assignable sequence dependent setup
    times.
so: Cowling, Peter (ed.) et al., Evolutionary computation in combinatorial
    optimization. 10th European conference, EvoCOP 2010, Istanbul, Turkey,
    April 7‒9, 2010. Proceedings. Berlin: Springer (ISBN
    978-3-642-12138-8/pbk). Lecture Notes in Computer Science 6022, 107-118
    (2010).
py: 2010
pu: Berlin: Springer
la: EN
cc: 
ut: metaheuristics; parallel machine scheduling; setup time; ILS; path
    relinking
ci: 
li: doi:10.1007/978-3-642-12139-5_10
ab: Summary: This paper addresses the unrelated parallel machine problem with
    machine and job sequence dependent setup. In this problem, the amount
    of the setup time does not only depend on the machine and job sequence,
    but also on a number of resources assigned, which can vary between a
    minimum and a maximum. The goal is to find a schedule that minimizes
    the linear combination of the total resources assigned and the total
    completion time. The problem is NP-hard in the strong sense. The
    NP-hardness of the problem motivates us to develop a new Iterated Local
    Search (ILS) heuristic to obtain near-optimal solutions. The heuristic
    uses an intensification strategy based on the Path Relinking technique
    which generates new solutions by exploring trajectories that connect
    high-quality solutions. Computational tests are carried out on a set of
    benchmark instances and the results obtained by the proposed ILS
    improve the best known results from the literature by a significant
    margin.
rv: