A review of scheduling problem and resolution methods in flexible flow shop
The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines. FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries. This review paper gives a comprehensive exploration review on the FFS sched...
Main Authors: | Tian-Soon Lee, Ying-Tai Loong |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2019-01-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol10/IJIEC_2018_6.pdf |
Similar Items
-
Analysis of dispatching rules application on scheduling problem in flexible-flow shop production
by: Rakićević Zoran M., et al.
Published: (2014-01-01) -
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
by: Xuelian Pang, et al.
Published: (2020-02-01) -
A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
by: Ghiath Al Aqel, et al.
Published: (2019-03-01) -
Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy
by: Xiuli Wu, et al.
Published: (2018-03-01) -
Solving Distributed and Flexible Job-Shop Scheduling Problems for a Real-World Fastener Manufacturer
by: Tung-Kuan Liu, et al.
Published: (2014-01-01)