Optimizing blocking flow shop scheduling problem with total completion time criterion

2013 ◽  
Vol 40 (7) ◽  
pp. 1874-1883 ◽  
Author(s):  
Ghasem Moslehi ◽  
Danial Khorasanian
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Time Criterion

scholarly journals Adaptation and parameters studies of CS algorithm for flow shop scheduling problem

2021 ◽  
Vol 11 (3) ◽  
pp. 2266
Author(s):  
Driss Belbachir ◽  
Fatima Boumediene ◽  
Ahmed Hassam ◽  
Ltéfa Ghomri
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Flow Shop Scheduling ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Permutation Flow Shop

Scheduling concerns the allocation of limited resources overtime to perform tasks to fulfill certain criterion and optimize one or several objective functions. One of the most popular models in scheduling theory is that of the flow-shop scheduling. During the last 40 years, the permutation flow-shop sequencing problem with the objective of makespan minimization has held the attraction of many researchers. This problem characterized as Fm/prmu/Cmax in the notation of Graham, involves the determination of the order of processing of n jobs on m machines. In addition, there was evidence that m-machine permutation flow-shop scheduling problem (PFSP) is strongly NP-hard for m ≥3. Due to this NP-hardness, many heuristic approaches have been proposed, this work falls within the framework of the scientific research, whose purpose is to study Cuckoo search algorithm. Also, the objective of this study is to adapt the cuckoo algorithm to a generalized permutation flow-shop problem for minimizing the total completion time, so the problem is denoted as follow: Fm | | Cmax. Simulation results are judged by the total completion time and algorithm run time for each instance processed.

A Heuristic Algorithm for Flow Shop Scheduling Problem

2014 ◽  
Vol 643 ◽  
pp. 374-379
Author(s):  
Hua Wei Yuan ◽  
Yuan Wei Jing ◽  
Tao Ren
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Numerical Experiments ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Large Size ◽  
Flow Shop Problem ◽  
Weighted Completion Time

This paper considers the m-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.

Sign in / Sign up

Export Citation Format

Share Document