Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

DOI10.1016/J.COR.2006.08.016zbMath1179.90160OpenAlexW2006358835MaRDI QIDQ941559

Gerardo Minella, Eva Vallada, Rubén Ruiz

Publication date: 1 September 2008

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

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

zbMATH Keywords

heuristicsschedulingmetaheuristicsflowshoptardiness

Mathematics Subject Classification ID

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

Related Items (35)

Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ A two-machine flowshop scheduling problem with precedence constraint on two jobs ⋮ Minimizing total tardiness in no-wait flowshops ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Simulation Optimization for MRO Systems Operations ⋮ The distributed permutation flowshop scheduling problem ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling

Cites Work

• Unnamed Item
• Scheduling flow shops using differential evolution algorithm
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• The two-machine flowshop scheduling problem with total tardiness
• A new heuristic method for the flow shop sequencing problem
• Minimizing total tardiness in permutation flowshops
• Restricted neighborhood in the tabu search for the flowshop problem
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• An SA/TS mixture algorithm for the scheduling tardiness problem
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• A comprehensive review and evaluation of permutation flowshop heuristics
• A decomposition algorithm for the single machine total tardiness problem
• Benchmarks for basic scheduling problems
• Note on minimizing total tardiness in a two-machine flowshop
• Minimizing Total Tardiness on One Machine is NP-Hard
• Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
• Focused Scheduling in Proportionate Flowshops
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• On general routing problems
• A Survey of Scheduling Rules
• Two-machine flowshop scheduling to minimize total tardiness
• Scheduling in flowshops to minimize total tardiness of jobs
• The Total Tardiness Problem: Review and Extensions
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics