Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint

2013 ◽  
Vol 146 (2) ◽  
pp. 667-678 ◽  
Author(s):  
Zhan-tao Li ◽  
Qing-xin Chen ◽  
Ning Mao ◽  
Xiaoming Wang ◽  
Jianjun Liu
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.


2011 ◽  
Vol 101-102 ◽  
pp. 783-789
Author(s):  
Zhan Tao Li ◽  
Qing Xin Chen ◽  
Ning Mao

Rapid access (RA) is an effective heuristic method for solving the permutation flow shop problem with the objective of makespan. This paper proposes a heuristic IRA (i.e., improved RA) for the two-stage flexible flow shop scheduling problem with head group constraint. In the heuristic IRA, two dispatch rules, i.e., earliest completion time first (ECT)) and earliest start time first (EST), are proposed for allocating devices for tasks. Benchmark testing results show that using ECT dispatch rule can significantly improve the performance of heuristic IRA. As comparison, the heuristic CDS and heuristic Palmer have also simulated under the same conditions, and the results show that the IRA is able to provide much better performance.


2011 ◽  
Vol 314-316 ◽  
pp. 2076-2081
Author(s):  
Zhan Tao Li ◽  
Qing Xin Chen ◽  
Ning Mao

Based on a background to the mould job shop, this paper considers a two-stage flexible flow shop scheduling problem subject to release dates, where the first stage is made up of unrelated machines and tasks have group constraint. The objective is to find a schedule that minimizes makespan in that flexible flow shop environment. For this problem, a mathematic model is formulated. Because this problem is NP-hard, an improved Palmer-based heuristic (denoted by MPL) is proposed. Based on MPL, a new heuristic (denoted by IMPL) is developed. In order to test the efficiency of the two heuristics, sets of examples are designed. Compared to the MPL, the performance of IMPL is more superior.


Sign in / Sign up

Export Citation Format

Share Document