Please use this identifier to cite or link to this item:

TitleVariable neighborhood search for integrated planning and scheduling
Author(s)Leite, Mário
Alves, Cláudio
Pinto, Telmo
Integrated optimization problems
Issue date2017
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract(s)In this paper, we consider the integrated planning and scheduling problem on parallel and identical machines. The problem is composed by two parts which are simultaneously solved in an integrated form. The first is the planning part, which consists in determining the jobs that should be processed in each period of time. The second is the scheduling part, which consists in assigning the jobs to the machines according to their release dates. We present new optimization approaches based on local search heuristics and metaheuristic methods based on variable neighborhood search using two neighborhood structures. Two different algorithms were implemented in the construction of initial solutions and combined with fifteen variants of the initial sequence of jobs. Computational experiments were performed with benchmark instances from the literature in order to assess the proposed methods.
TypeConference paper
AccessRestricted access (UMinho)
Appears in Collections:CAlg - Livros e capítulos de livros/Books and book chapters

Files in This Item:
File Description SizeFormat 
Artigo ICCSA 2017.pdf
  Restricted access
881,56 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID