Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness

DOI10.1016/j.cor.2015.05.006zbMath1349.90345OpenAlexW353205918MaRDI QIDQ342073

Victor Fernandez-Viagas, Jose M. Framinan

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.2015.05.006

zbMATH Keywords

heuristicsschedulingmakespanflowshopnehmaximum tardinessbounded insertionnon-population algorithmpfsp

Mathematics Subject Classification ID

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

Related Items (5)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
• Benchmarks for shop scheduling problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• Benchmarks for basic scheduling problems
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Manufacturing Scheduling Systems

This page was built for publication: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness