Adaptation and parameters studies of CS Algorithm for flow shop scheduling problem

Driss Belbachir, Fatima Boumediene, Ahmed Hassam, Ltéfa Ghomri

Abstract


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.

Keywords


combinatorial optimization; cuckoo search algorithm; flow-shop problem; meta-heuristics; scheduling problems;



DOI: http://doi.org/10.11591/ijece.v11i3.pp%25p
Total views : 0 times


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

ISSN 2088-8708, e-ISSN 2722-2578