scholarly journals The Hybrid Ant Lion Optimization Flow Shop Scheduling Problem for Minimizing Completion Time

2020 ◽  
Vol 1569 ◽  
pp. 022097 ◽  
Author(s):  
Dian Setiya Widodo ◽  
Dana Marsetiya Utama
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Ant Lion Optimization ◽  
Ant Lion

scholarly journals An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem

2020 ◽  
Vol 6 (1) ◽  
pp. 23 ◽  
Author(s):  
Dana Marsetiya Utama ◽  
Dian Setiya Widodo ◽  
Muhammad Faisal Ibrahim ◽  
Shanty Kusuma Dewi
Keyword(s):  
Numerical Experiments ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Ant Lion Optimization ◽  
Lion Algorithm ◽  
Permutation Flow Shop ◽  
Mean Tardiness ◽  
Ant Lion

This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEH-EDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments.

scholarly journals Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Kaifeng Geng ◽  
Chunming Ye ◽  
Zhen hua Dai ◽  
Li Liu
Keyword(s):  
Energy Consumption ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
High Price ◽  
Hybrid Flow Shop ◽  
Shop Scheduling ◽  
Ant Lion Optimization ◽  
Hybrid Flow Shop Scheduling ◽  
Consumption Cost ◽  
Ant Lion

Re-entrant hybrid flow shop scheduling problem (RHFSP) is widely used in industries. However, little attention is paid to energy consumption cost with the raise of green manufacturing concept. This paper proposes an improved multiobjective ant lion optimization (IMOALO) algorithm to solve the RHFSP with the objectives of minimizing the makespan and energy consumption cost under Time-of-Use (TOU) electricity tariffs. A right-shift operation is then used to adjust the starting time of operations by avoiding the period of high electricity price to reduce the energy consumption cost as far as possible. The experimental results show that IMOALO algorithm is superior to multiobjective ant lion optimization (MOALO) algorithm, NSGA-II, and MOPSO in terms of the convergence, dominance, and diversity of nondominated solutions. The proposed model can make enterprises avoid high price period reasonably, transfer power load, and reduce the energy consumption cost effectively. Meanwhile, parameter analysis indicates that the period of TOU electricity tariffs and energy efficiency of machines have great impact on the scheduling results.

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.

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.

scholarly journals Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs

2021 ◽  
Vol 5 (2) ◽  
pp. 1-8
Author(s):  
SATHIYA SHANTHI R ◽  
MEGANATHAN R ◽  
JAYAKUMAR S ◽  
VIJAYARAGAVAN R
Keyword(s):  
Completion Time ◽  
Systematic Approach ◽  
Flow Shop ◽  
Experimental Results ◽  
The Other ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Makespan Minimization ◽  
Shop Scheduling

Scheduling process arises naturally upon availability of resources through a systematic approach in which prior planning and decisions should be made. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954 with makespan minimization as objective. Earlier we proposed two algorithms for the makespan objective; in this paper we intend to investigate the same algorithms for the objective of Total Completion Time of all the jobs (TCT). Experimental results had shown that one of our algorithms gives better results than the other two when the machine order is reversed.

Sign in / Sign up

Export Citation Format

Share Document