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

DOI10.1016/j.cor.2008.11.004zbMath1179.90138OpenAlexW2044450133MaRDI QIDQ1010274

Mansour Eddaly, Patrick Siarry, Bassem Jarboui

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.004

zbMATH Keywords

schedulingflowtimeestimation of distribution algorithmpermutation flowshopvariable neighbourhood search

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Deterministic scheduling theory in operations research (90B35)

Related Items

An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ An efficient mixture sampling model for Gaussian estimation of distribution algorithm ⋮ Organization learning oriented approach with application to discrete flight control ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Variable neighbourhood search: methods and applications ⋮ A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets ⋮ Memory and Learning in Metaheuristics

Cites Work

• Unnamed Item
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
• A genetic algorithm for flowshop sequencing
• Flowshop scheduling with dominant machines
• Variable neighborhood search
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Flowshop scheduling research after five decades
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Variable neighborhood search: Principles and applications
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem