Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness

DOI10.1016/j.cor.2016.05.006zbMath1349.90344OpenAlexW2354105049MaRDI QIDQ342504

Manuel Dios, 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.2016.05.006

zbMATH Keywords

heuristicsschedulingearlinessflowshoptardinessPFSP

Mathematics Subject Classification ID

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

Related Items (2)

Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling

Cites Work

• 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 comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum 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
• The distributed permutation flowshop scheduling problem
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• Heuristics for the flow line problem with setup costs
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• A comprehensive review and evaluation of permutation flowshop heuristics
• A decomposition algorithm for the single machine total tardiness problem
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Permutation flow shop scheduling with earliness and tardiness penalties
• Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• Minimizing mean absolute deviation of completion times about a common due date
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Flowshop-scheduling problems with makespan criterion: a review

This page was built for publication: Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness