An algorithm for multi-objective job shop scheduling problem

Journal of Industrial Engineering International

مقاله 5، دوره 2، شماره 3، آذر 2006، صفحه 43-53   

نویسندگان

Parviz Fattahi^{* 1}؛ Mohammad Saidi Mehrabad²؛ Mir B. Aryanezhad³

¹Ph.D. Candidate, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

²Associate Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

³Professor, Dep. of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

چکیده

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we propose a Pareto approach to solve multi-objective job shop scheduling. The objective considered is to minimize the overall completion time (makespan) and total weighted tardiness (TWT). An effective simulated annealing algorithm based on proposed approach is presented to solve multi-objective job shop scheduling problems. An external memory of non-dominated solutions is considered to save and update the non-dominated solutions during the problem solving process. The parameters in the proposed algorithm are determined after conducting a pilot study. Numerical examples are used to evaluate and study the performance of the proposed algorithm.

کلیدواژه‌ها

Job shop؛ Scheduling؛ Pareto approach؛ Simulated Annealing؛ Multi-objective