New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem

DOI10.1016/J.COR.2016.04.007zbMath1349.90300OpenAlexW2341031254MaRDI QIDQ342481

Hamid Abedinnia, Christoph H. Glock, Andreas Brill

Publication date: 17 November 2016

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

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

zbMATH Keywords

heuristicspermutation flowshopflowshop scheduling problemtotal flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ Optimization of stability of humanoid robot NAO using ant colony optimization tuned MPC controller for uneven path

Cites Work

• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• An improved NEH-based heuristic for the permutation flowshop problem
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
• An empirical analysis of the optimality rate of flow shop heuristics
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A comprehensive review and evaluation of permutation flowshop heuristics
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Local search methods for the flowshop scheduling problem with flowtime minimization
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Flowshop scheduling research after five decades
• Performance guarantees for flowshop heuristics to minimize makespan
• The Complexity of Flowshop and Jobshop Scheduling
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Flowshop-scheduling problems with makespan criterion: a review
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• Scheduling

This page was built for publication: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem