TY - JOUR
T1 - Multi-objective optimization for stochastic failure-prone job shop scheduling problem via hybrid of NSGA-II and simulation method
AU - Amelian, Sayed Shahab
AU - Sajadi, Seyed Mojtaba
AU - Navabakhsh, Mehrzad
AU - Esmaelian, Majid
PY - 2022/2
Y1 - 2022/2
N2 - Production scheduling and reliability of machinery are prominent issues in flexible manufacturing systems that are led to decreasing of production costs and increasing of system efficiency. In this paper, multiobjective optimization of stochastic failure-prone job shop scheduling problem is sought wherein that job processing time seems to be controllable. It endeavours to determine the best sequence of jobs, optimal production rate, and optimum preventive maintenance period for simultaneous optimization of three criteria of sum of earliness and tardiness, system reliability, and energy consumption. First, a new mixed integer programming model is proposed to formulate the problem. Then, by combining of simulation and NSGA-II algorithm, a new algorithm is put forward for solving the problem. A set of Pareto optimal solutions is achieved through this algorithm. The stochastic failure-prone job shop with controllable processing times has not been investigated in the earlier research, and for the first time, a new hedging point policy is presented. The computational results reveal that the proposed metaheuristic algorithm converges into optimal or near-optimal solution. To end, results and managerial insights for the problem are presented.
AB - Production scheduling and reliability of machinery are prominent issues in flexible manufacturing systems that are led to decreasing of production costs and increasing of system efficiency. In this paper, multiobjective optimization of stochastic failure-prone job shop scheduling problem is sought wherein that job processing time seems to be controllable. It endeavours to determine the best sequence of jobs, optimal production rate, and optimum preventive maintenance period for simultaneous optimization of three criteria of sum of earliness and tardiness, system reliability, and energy consumption. First, a new mixed integer programming model is proposed to formulate the problem. Then, by combining of simulation and NSGA-II algorithm, a new algorithm is put forward for solving the problem. A set of Pareto optimal solutions is achieved through this algorithm. The stochastic failure-prone job shop with controllable processing times has not been investigated in the earlier research, and for the first time, a new hedging point policy is presented. The computational results reveal that the proposed metaheuristic algorithm converges into optimal or near-optimal solution. To end, results and managerial insights for the problem are presented.
KW - controllable processing times
KW - failure-prone manufacturing systems
KW - modified hedging point policy
KW - Pareto optimal solutions
KW - stochastic job shop scheduling
UR - http://www.scopus.com/inward/record.url?scp=85123560857&partnerID=8YFLogxK
UR - https://onlinelibrary.wiley.com/doi/10.1111/exsy.12455
U2 - 10.1111/exsy.12455
DO - 10.1111/exsy.12455
M3 - Article
AN - SCOPUS:85123560857
SN - 0266-4720
VL - 39
JO - Expert Systems
JF - Expert Systems
IS - 2
M1 - e12455
ER -