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

TitleFast heuristics for integrated planning and scheduling
Author(s)Rietz, Jurgen Endre
Alves, Cláudio
Valério de Carvalho, José Manuel
Low complexity
Issue date2015
JournalLecture Notes in Computer Science
Abstract(s)In this paper, we address the integrated planning and scheduling problem on parallel machines in which a set of jobs with release and due-dates have to be assigned first to consecutive time periods within the planning horizon, and then scheduled on the available machines. We explore in particular different alternative low complexity heuristics. The importance of job sequencing in the performance of these heuristics is analyzed, and a new property characterizing the optimal solutions of the problem is described. We also present a heuristic that yields optimal solutions for specific instances of the problem, and local exchange procedures that proved to be effective. To the best of our knowledge, these are the first contributions concerning the heuristic solution of this integrated planning and scheduling problem through low complexity procedures. To evaluate performance of these heuristics, we report on extensive computational experiments on benchmark instances of the literature.
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 
Fast heuristics for integrated planning and scheduling.pdf
  Restricted access
176,14 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