Paper Info
Title
Fast Heuristics For Integrated Planning And Scheduling
Abstract
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.
Year
DOI
Venue
2015
10.1007/978-3-319-21407-8_30
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2015, PT II
Keywords
Field
DocType
Planning, Scheduling, Heuristics, Low complexity
Heuristic,Mathematical optimization,Job shop scheduling,Time horizon,Computer science,Scheduling (computing),Heuristics,Integrated business planning
Conference
Volume
ISSN
Citations 
9156
0302-9743
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Jürgen Rietz1364.45
Cláudio Alves218416.29
José M. Valério De Carvalho316814.06