NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness

DOI10.1016/j.cor.2015.02.002zbMath1348.90258OpenAlexW1995660472MaRDI QIDQ337554

Victor Fernandez-Viagas, Jose M. Framinan

Publication date: 10 November 2016

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

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

zbMATH Keywords

heuristicsschedulingflowshoptardinessnehPFSPtie-breaking mechanism

Mathematics Subject Classification ID

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

Related Items (25)

Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ 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 ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ 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 simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Simulation Optimization for MRO Systems Operations ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• Some efficient heuristic methods for the flow shop sequencing problem
• An improved NEH-based heuristic for the permutation flowshop problem
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• An empirical analysis of the optimality rate of flow shop heuristics
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• 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
• Heuristics for scheduling in a flow shop with multiple processors
• A decomposition algorithm for the single machine total tardiness problem
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Scheduling in flowshops to minimize total tardiness of jobs
• 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
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

This page was built for publication: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness