A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines

2007 ◽  
Vol 182 (2) ◽  
pp. 945-951 ◽  
Author(s):  
Christos Koulamas ◽  
George J. Kyparisis
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Two Stage ◽  
Shop Scheduling

scholarly journals Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

2017 ◽  
Vol 10 (5) ◽  
pp. 887 ◽  
Author(s):  
Hassan Jafarzadeh ◽  
Nazanin Moradinasab ◽  
Ali Gerami
Keyword(s):  
Parallel Machines ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Two Stage ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Multi Objective ◽  
No Wait ◽  
Flexible Flow Shop Scheduling

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.

A two-stage flow shop scheduling problem with transportation considerations

4OR ◽  
2015 ◽  
Vol 13 (4) ◽  
pp. 381-402 ◽  
Author(s):  
Nacira Chikhi ◽  
Moncef Abbas ◽  
Rachid Benmansour ◽  
Abdelghani Bekrar ◽  
Saïd Hanafi
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Two Stage ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document