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.006MaRDI QIDQ342073zbMATH OpenOpenAlexFDO

Authors 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

heuristicsschedulingmakespanflowshopnehbounded insertionmaximum tardinessnon-population algorithmpfsp

Mathematics Subject Classification ID

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

Recommendations

• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
• A single-objective heuristic algorithm subject to a given upper bound of maximum tardiness
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

Cites work

• scientific article; zbMATH DE number 7722 (Why is no real title available?)
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• A comprehensive review and evaluation of permutation flowshop heuristics
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Benchmarks for basic scheduling problems
• Benchmarks for shop scheduling problems
• Manufacturing Scheduling Systems
• 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
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

Cited in

(12)

• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• A single-objective heuristic algorithm subject to a given upper bound of maximum tardiness
• 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
• New efficient heuristics for scheduling open shops with makespan minimization
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
• Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
• Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342073)