loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Matheus Nohra Haddad 1 ; Luciano Perdigão Cota 1 ; Marcone Jamilson Freitas Souza 1 and Nelson Maculan 2

Affiliations: 1 Universidade Federal de Ouro Preto, Brazil ; 2 Universidade Federal do Rio de Janeiro, Brazil

ISBN: 978-989-758-027-7

Keyword(s): Unrelated Parallel Machine Scheduling, Iterated Local Search, Random Variable Neighborhood Descent, Makespan.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Enterprise Information Systems ; Industrial Applications of Artificial Intelligence ; Operational Research ; Problem Solving ; Scheduling and Planning ; Strategic Decision Support Systems

Abstract: This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the maximum completion time of the schedule, the so-called makespan. This problem is commonly found in industrial processes like textile manufacturing and it belongs to NP-Hard class. It is proposed an algorithm named AIV based on Iterated Local Search (ILS) and Variable Neighborhood Descent (VND). This algorithm starts from an initial solution constructed on a greedy way by the Adaptive Shortest Processing Time (ASPT) rule. Then, this initial solution is refined by ILS, using as local search the Random VND procedure, which explores neighborhoods based on swaps and multiple insertions. In this procedure, here called RVND, there is no fixed sequence of neighborhoods, because they are sorted on each application of the local search. In AIV each perturbation is characterized by removing a job from one machine and inserting it into another machine. AIV was tested using benchmark instances from literature. Statistical analysis of the computational experiments showed that AIV outperformed the algorithms of the literature, setting new improved solutions. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.236.234.60

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Nohra Haddad M., Perdigão Cota L., Jamilson Freitas Souza M. and Maculan N. (2014). AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times.In Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-027-7, pages 376-383. DOI: 10.5220/0004884603760383

@conference{iceis14,
author={Matheus Nohra Haddad and Luciano Perdigão Cota and Marcone Jamilson Freitas Souza and Nelson Maculan},
title={AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times},
booktitle={Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2014},
pages={376-383},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004884603760383},
isbn={978-989-758-027-7},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times
SN - 978-989-758-027-7
AU - Nohra Haddad M.
AU - Perdigão Cota L.
AU - Jamilson Freitas Souza M.
AU - Maculan N.
PY - 2014
SP - 376
EP - 383
DO - 10.5220/0004884603760383

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.