Mathematical modeling and heuristic approaches to flexible job shop scheduling problems |
| |
Authors: | Parviz Fattahi Mohammad Saidi Mehrabad Fariborz Jolai |
| |
Affiliation: | (1) Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran;(2) Department of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran;(3) Industrial Engineering Department, Faculty of Engineering, University of Tehran, Tehran, Iran |
| |
Abstract: | Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem in medium and actual size problem with traditional optimization approaches owing to the high computational complexity. For solving the realistic case with more than two jobs, two types of approaches have been used: hierarchical approaches and integrated approaches. In hierarchical approaches assignment of operations to machines and the sequencing of operations on the resources or machines are treated separately, i.e., assignment and sequencing are considered independently, where in integrated approaches, assignment and sequencing are not differentiated. In this paper, a mathematical model and heuristic approaches for flexible job shop scheduling problems (FJSP) are considered. Mathematical model is used to achieve optimal solution for small size problems. Since FJSP is NP-hard problem, two heuristics approaches involve of integrated and hierarchical approaches are developed to solve the real size problems. Six different hybrid searching structures depending on used searching approach and heuristics are presented in this paper. Numerical experiments are used to evaluate the performance of the developed algorithms. It is concluded that, the hierarchical algorithms have better performance than integrated algorithms and the algorithm which use tabu search and simulated annealing heuristics for assignment and sequencing problems consecutively is more suitable than the other algorithms. Also the numerical experiments validate the quality of the proposed algorithms. |
| |
Keywords: | Flexible job shop Scheduling Tabu search Simulated annealing Hierarchical approach |
本文献已被 SpringerLink 等数据库收录! |
|