Publications / 2008 Proceedings of the 25th ISARC, Vilnius, Lituania

Variable Neighborhood Simulated Annealing Method and Application for Design

Gražvydas Felinskas, Leonidas Sakalauskas
Pages 566-572 (2008 Proceedings of the 25th ISARC, Vilnius, Lituania, ISBN 978-9955-28-304-1, ISSN 2413-5844)
Abstract:

In this paper we discuss about production scheduling. In manufacturing industry, efficient methods to solve resource constrained scheduling problems are needed. The aim is to find such schedule, which would meet the requirements of job priority relations, resource constraints, minimizing it by some criteria. In many cases this criterion is project’s finishing time. We consider job scheduling and optimization algorithms related to resources, time and other constraints. In most cases, scheduling problems belongs to complexity class NP. In order to schedule and optimize jobs, we may apply heuristic methods. We explore application of Simulated Annealing (SA) method combined with variable neighborhood to schedule optimization. Computational results are given using data sets from the project scheduling problems library. Efficiency of the algorithm was tested on high performance computing machine.

Keywords: Resource Constrained, Schedule Optimization, Simulated Annealing, Variable Neighborhood.