Original scientific paper

Multi-projects scheduling with resource constraints & Priority rules by the use of Simulated Annealing Algorithm

Vahid Majazi Dalfard ; Young Researchers Club, Kerman Branch, Islamic Azad University, Kerman, Iran
Vahid Ranjbar ; Department of Industrial Engineering, Faculty of Mechanical and Industrial Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

Abstract

This paper presents a hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times, with objectives, namely the minimizing of weighted, sum of total weighted squared tardiness, makespan, and total weighted squared earliness and number of tardy jobs. Since the problem is NP-hard, we solved this problem by hybrid genetic algorithm. To validate the proposed model, the Lingo 8.0 software is used. Comparison between the results of the Lingo 8.0 and hybrid genetic algorithm shows that in larger problems (if n > 10, where n is the number of jobs) the results obtained by Lingo do not have good efficiency and cannot be compared with the proposed hybrid genetic algorithm in terms of computational time and deviation from the minimum objective function. Test results are provided for a wide range of problem instances.

Keywords

priority rules; project management; RCMPSP; scheduling; Simulated Annealing Algorithm

Hrčak ID:

86720

URI

https://hrcak.srce.hr/86720

Publication date:

19.9.2012.

Article data in other languages: croatian

Visits: 5.051 *