scholarly journals Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy

2018 ◽  
Vol 10 (3) ◽  
pp. 841 ◽  
Author(s):  
Xiuli Wu ◽  
Xianli Shen ◽  
Qi Cui
2017 ◽  
Vol 10 (5) ◽  
pp. 887 ◽  
Author(s):  
Hassan Jafarzadeh ◽  
Nazanin Moradinasab ◽  
Ali Gerami

Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem.Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm.Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm.Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Yuquan Wang ◽  
Naiming Xie

Purposepurpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop.Design/methodology/approachA flexible flow scheduling model and algorithm with interval grey processing time is established. First, according to actual needs of composite laminate shop scheduling process, interval grey number is used to represent uncertain processing time, and interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart, and other methods are further applied. Then a flexible flow shop scheduling model with interval grey processing time (G-FFSP) is established, and an artificial bee colony algorithm based on an adaptive neighbourhood search strategy is designed to solve the model. Finally, six examples are generated for simulation scheduling, and the efficiency and performance of the model and algorithm are evaluated by comparing the results.FindingsResults show that flexible flow shop scheduling model and algorithm with interval grey processing time can provide an optimal solution for composite lay-up shop scheduling problems and other similar flow shop scheduling problems.Social implicationsUncertain processing time is common in flexible workshop manufacturing, and manual scheduling greatly restricts the production efficiency of workshop. In this paper, combined with grey system theory, an intelligent algorithm is used to solve flexible flow shop scheduling problem to promote intelligent and efficient production of enterprises.Originality/valueThis paper applies and perfects interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart and other methods. A flexible flow shop scheduling model with interval grey processing time is established, and an artificial bee colony algorithm with an adaptive domain search strategy is designed. It provides a comprehensive solution for flexible flow shop scheduling with uncertain processing time.


Sign in / Sign up

Export Citation Format

Share Document