On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

DOI10.1016/j.cor.2013.12.012zbMath1348.90256OpenAlexW2111060121MaRDI QIDQ336966

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

zbMATH Keywords

heuristicsschedulingflowshopNEH

Mathematics Subject Classification ID

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

Related Items (29)

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 ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ 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 ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ 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 ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ \(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion

Cites Work

• Unnamed Item
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• An improved NEH-based heuristic for the permutation flowshop problem
• An empirical analysis of the optimality rate of flow shop heuristics
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A comprehensive review and evaluation of permutation flowshop heuristics
• Benchmarks for basic scheduling problems
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Optimal two- and three-stage production schedules with setup times included
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A high quality solution constructive heuristic for flow shop sequencing
• 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
• Flowshop-scheduling problems with makespan criterion: a review

This page was built for publication: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem