An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Authors:
Bassem Jarboui;Mansour Eddaly;Patrick Siarry
Affiliations:
FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie;FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie;LiSSi, Université de Paris 12, 61 avenue du Général de Gaulle, 94010 Créteil, France
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 21

Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation

Annals of Operations Research
An effective heuristic for flow shop problems with total flow time as criterion

Proceedings of the 15th annual conference on Computers and industrial engineering
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Flowshop scheduling with dominant machines

Computers and Operations Research
Variable neighborhood search

Computers and Operations Research
A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)

Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing)
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering

A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times

Computers and Operations Research
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering
A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem

Expert Systems with Applications: An International Journal
An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization

Expert Systems with Applications: An International Journal
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

Computers and Industrial Engineering
Tabu Search with two approaches to parallel flowshop evaluation on CUDA platform

Journal of Parallel and Distributed Computing
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal
An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem

Computers and Operations Research
A hybrid estimation of distribution algorithm for solving the resource-constrained project scheduling problem

Expert Systems with Applications: An International Journal
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems

Computers and Operations Research
Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems

Computers and Industrial Engineering
A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates

Engineering Applications of Artificial Intelligence
Guided restarting local search for production planning

Engineering Applications of Artificial Intelligence
A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem

Computers and Industrial Engineering
New VNS heuristic for total flowtime flowshop scheduling problem

Expert Systems with Applications: An International Journal
Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

Expert Systems with Applications: An International Journal
Invited Review: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

Computers and Operations Research
A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Computers and Operations Research
An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Advances in Engineering Software
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem

Applied Soft Computing
Artificial chromosomes with genetic algorithm 2 (ACGA2) for single machine scheduling problems with sequence-dependent setup times

Applied Soft Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

In this work we propose an estimation of distribution algorithm (EDA) as a new tool aiming at minimizing the total flowtime in permutation flowshop scheduling problems. A variable neighbourhood search is added to the algorithm as an improvement procedure after creating a new offspring. The experiments show that our approach outperforms all existing techniques employed for the problem and can provide new upper bounds.