scholarly journals The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time

2021 ◽  
Vol 22 (2) ◽  
pp. 224-235
Author(s):  
Ikhlasul Amallynda ◽  
Bhisma Hutama
Keyword(s):  
Travel Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Computational Results ◽  
Shop Scheduling ◽  
Flow Shop Problem ◽  
Scheduling Method ◽  
Moth Flame Optimization Algorithm ◽  
Iteration Parameters

This article examined the flow shop scheduling problem by considering the travel time between machines. The objective function of this problem was to provide a makespan. The Moth Flame Optimization (MFO) algorithm was proposed to solve the flow shop problem. The MFO experiment was carried out with a combination of iteration parameters and the population of the MFO algorithm to solve the flow shop scheduling problem. The computational results showed that MFO could produce a better solution than the actual scheduling method. Furthermore, the MFO Proposal Algorithm was able to reduce the makespan by up to 3%.

scholarly journals An ant colony system for solving fuzzy flow shop scheduling problem

2012 ◽  
Vol 1 (2) ◽  
pp. 44 ◽  
Author(s):  
Nasser Shahsavari Pour ◽  
Mohammad hossein Abolhasani Ashkezari ◽  
Hamed Mohammadi Andargoli
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Process Time ◽  
Ant Colony System ◽  
Scheduling Problem ◽  
Computational Results ◽  
Shop Scheduling ◽  
The Past

During the past years, the flow shop has been regarded by many researchers and some extensive investigations have been done on this respect. Flow Shop includes n works performed on m machines in a same sequence. It is very difficult in the real world to determine the exact process time of an operation on a machine. Therefore, we consider in this article the process time as trapezoidal fuzzy numbers. Our purpose is that we obtain a sequence of works using such fuzzy numbers in order to minimize maximum fuzzy time of completion entire jobs or fuzzy makespan. We offered an optimization algorithm of Ant Colony System (ACS) to solve this problem. Finally, we present computational results for explanation and comparison with other articles in future.

GA-BASED IMPROVEMENT HEURISTIC FOR MINIMIZING MAKESPAN IN A GENERAL FLOW-SHOP SCHEDULING PROBLEM

2021 ◽  
pp. 1109-1115
Author(s):  
Brahma Datta Shukla, Pragya Singh Tomar
Keyword(s):  
Lower Bound ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
General Flow ◽  
Constructive Heuristic ◽  
Permutation Flow Shop ◽  
Constructive Heuristics ◽  
Flow Shop Problem

The study proposes an evolutionary algorithm-based improvement heuristic for the permutation flow-shop problem. The method uses a constructive heuristic to arrive at a good first solution. The GA-based improvement heuristic is used in conjunction with CDS, Gupta's algorithm, and Palmer's Slope Index, which are all well-known constructive heuristics. The method is put to the test on a series of ten issues that vary from 4 to 25 tasks and 4 to 30 machines. The outcomes are also compared to some of the most well-known lower-bound options

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.

AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER

2007 ◽  
Vol 18 (03) ◽  
pp. 565-591 ◽  
Author(s):  
ALAN J. SOPER ◽  
VITALY A. STRUSEVICH
Keyword(s):  
Approximation Algorithm ◽  
Flow Shop ◽  
Optimal Schedule ◽  
Flow Shop Scheduling ◽  
Polynomial Algorithms ◽  
Linear Programs ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Integer Linear Programs ◽  
Flow Shop Problem

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a [Formula: see text]–approximation algorithm that outputs a two-shipment schedule. We design a [Formula: see text]–approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables.

Basic Concept of Implementing Artificial Bee Colony (ABC) System in Flow Shop Scheduling

2013 ◽  
Vol 315 ◽  
pp. 385-388 ◽  
Author(s):  
Ho Yoong Chow ◽  
Sulaiman Hasan ◽  
Salleh Ahmad Bareduan
Keyword(s):  
Production System ◽  
Artificial Bee Colony ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Bee Colony ◽  
Flow Shop Problem ◽  
Flowshop Scheduling Problem ◽  
Optimum Solution

Flow shop scheduling is a common operational problem in a production system. Effective flow shop scheduling can help the company to improve the management system, hence increase income. Artificial Bee Colony (ABC) is a system that is widely used for scheduling optimization in a production system since 2005. However, the fundamental ABC system uses a heuristic approach to obtain an optimum solution which may not be the optimum solution at all. The ABC system is tested on the speed to obtain the optimum solution for a flowshop scheduling problem and measures the applicability of the schedule in terms of makespan. A simple model of ABC algorithm was developed to identify the effectiveness of the ABC for solving flow shop scheduling problem compared to other established methods. Result shows the ABC model is capable of producing best makespan in flow shop problem tested.

An efficiency improvement of flexible flow shop scheduling in automotive part company

2020 ◽  
pp. 1-14
Author(s):  
Waraporn Fangrit ◽  
Hwa Jen Yap ◽  
Mukhtar Fatihu Hamza ◽  
Siow-Wee Chang ◽  
Keem Siah Yap ◽  
...  
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Simulation Software ◽  
Flow Shop Scheduling ◽  
Current Status ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Scheduling Method ◽  
Automotive Part ◽  
Flexible Flow Shop Scheduling

Flexible flow shop is becoming more interested and applied in industries due to its impact from higher workloads. Flexible flow shop scheduling problem is focused to minimize the makespan. A metaheuristic model based on Hybrid Tabu Search is developed to overcome this problem. Firstly, Hybrid Tabu Search is modelled based on the factory data. The Earliest Due Date rule is used as the scheduling method for the current status. FlexSim simulation software is used to evaluate the Hybrid Tabu Search model. The outcome is validated with two different basic heuristic solutions; Campbell, Dudek and Smith’s and Gupta’s heuristics. It is found that the proposed model can improve the job sequence based on makespan criteria.

Sign in / Sign up

Export Citation Format

Share Document