scholarly journals A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs

2014 ◽  
Vol 524 ◽  
pp. 78-89 ◽  
Author(s):  
Qi Wei ◽  
Erfang Shan ◽  
Liying Kang
Keyword(s):  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Optimal Algorithms ◽  
Two Stage ◽  
Flow Shop Problem ◽  
Identical Jobs

scholarly journals Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

2014 ◽  
Vol 39 (1) ◽  
pp. 3-16 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov ◽  
Assaf Sarig
Keyword(s):  
Flow Shop ◽  
Optimal Solution ◽  
Setup Time ◽  
Optimal Number ◽  
Two Stage ◽  
Second Stage ◽  
Flow Shop Problem ◽  
Batch Sizes ◽  
Batch Schedule ◽  
Identical Jobs

Abstract We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines

scholarly journals A two-stage hybrid flow shop problem with dedicated machine and release date

2018 ◽  
Vol 126 ◽  
pp. 214-223
Author(s):  
Zouhour Nabli ◽  
Soulef Khalfallah ◽  
Ouajdi Korbaa
Keyword(s):  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Release Date ◽  
Two Stage ◽  
Flow Shop Problem

The Optimal Algorithm of a Two-Stage Flow Shop Problem with Infinite Number of Jobs

2011 ◽  
Vol 101-102 ◽  
pp. 290-293
Author(s):  
Qi Wei ◽  
Yong Wu
Keyword(s):  
Data Processing ◽  
Infinite Number ◽  
Flow Shop ◽  
Optimal Algorithm ◽  
Two Stage ◽  
Throughput Rate ◽  
Flow Shop Problem ◽  
Graphics Processing ◽  
Identical Jobs

In this paper, a two-machine two-stage flow shop with identical jobs is considered. Each of identical jobs has two tasks. The first task can be processed on either machine, called flexible task, while the second task must be processed on the second machine and can't be processed unless the first task has been processed. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of maximizing the throughput rate. This model is applied to the graphic programs processing which comprises data processing and graphics processing. We consider three cases regarding the capacity of the buffer between the machines with infinite number of jobs. We present optimal algorithm for each variant of the problem.

A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem

2015 ◽  
Vol 7 (3) ◽  
pp. 1-16 ◽  
Author(s):  
Latifa Dekhici ◽  
Khaled Belkadi
Keyword(s):  
Flow Shop ◽  
Bat Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Discrete Version ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling ◽  
Flow Shop Problem ◽  
Two Stages ◽  
Modified Bat Algorithm

In the last years, a set of bio-inspired metaheuristics has proved their efficiencies in combinational and continues optimization areas. This paper intends to hybrid a discrete version of Bat Algorithm (BA) with Generalized Evolutionary Walk Algorithm (GEWA) to solve the mono-processors two stages Hybrid Flow Shop scheduling. The authors compare the modified bat algorithm with the original one, with Particle Swarm Optimization (PSO) and with others results taken from literature. Computational results on a standard two-stage hybrid flow shop benchmark of 70 cases, and about 1700 instances, indicate that the proposed algorithm finds the best makespan (Cmax) in a good processing time comparing to the original bat algorithm and other algorithms.

A note on the two-stage hybrid flow shop problem with dedicated machines

2011 ◽  
Vol 6 (8) ◽  
pp. 1731-1736 ◽  
Author(s):  
Hatem Hadda ◽  
Najoua Dridi ◽  
Sonia Hajri-Gabouj
Keyword(s):  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Two Stage ◽  
Dedicated Machines ◽  
Flow Shop Problem

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Parallel Machines ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

Sign in / Sign up

Export Citation Format

Share Document