An interactive algorithm for multi-objective flow shop scheduling with fuzzy processing time through resolution method and TOPSIS

2012 ◽  
Vol 66 (5-8) ◽  
pp. 1047-1064 ◽  
Author(s):  
Mahdi Nakhaeinejad ◽  
Nasim Nahavandi
Processes ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 789
Author(s):  
Hao Sun ◽  
Aipeng Jiang ◽  
Dongming Ge ◽  
Xiaoqing Zheng ◽  
Farong Gao

This work focuses on the study of robust no-wait flow shop scheduling problem (R-NWFSP) under the interval-valued fuzzy processing time, which aims to minimize the makespan within an upper bound on total completion time. As the uncertainty of actual job processing times may cause significant differences in processing costs, a R-NWFSP model whose objective function involves interval-valued fuzzy sets (IVFSs) is proposed, and an improved SAA is designed for its efficient solution. Firstly, based on the credibility measure, chance constrained programming (CCP) is utilized to make the deterministic transformation of constraints. The uncertain NWFSP is transformed into an equivalent deterministic linear programming model. Then, in order to tackle the deterministic model efficiently, a simulated annealing algorithm (SAA) is specially designed. A powerful neighborhood search method and new acceptance criterion are applied to find better solutions. Numerical computations demonstrate the high efficiency of the SAA. In addition, a sensitivity analysis convincingly shows that the applicability of the proposed model and its solution strategy under interval-valued fuzzy sets.


2021 ◽  
pp. 1-13
Author(s):  
Orhan Engin ◽  
Mustafa Kerim Yılmaz

In the conventional scheduling problem, the parameters such as the processing time for each job and due dates are usually assumed to be known exactly, but in many real-world applications, these parameters may very dynamically due to human factors or operating faults. During the last decade, several works on scheduling problems have used a fuzzy approach including either uncertain or imprecise data. A fuzzy logic based tool for multi-objective Hybrid Flow-shop Scheduling with Multi-processor Tasks (HFSMT) problem is presented in this paper. In this study, HFSMT problems with a fuzzy processing time and a fuzzy due date are formulated, taking Oğuz and Ercan’s benchmark problems in the literature into account. Fuzzy HFSMT problems are formulated by three-objectives: the first is to maximize the minimum agreement index and the second is to maximize the average agreement index, and the third is to minimize the maximum fuzzy completion time. An efficient genetic algorithm(GA) is proposed to solve the formulated fuzzy HFSMT problems. The feasibility and effectiveness of the proposed method are demonstrated by comparing it with the simulated annealing (SA) algorithm in the literature.


Sign in / Sign up

Export Citation Format

Share Document