The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem

DOI10.1016/J.EJOR.2021.05.014MaRDI QIDQ2242240zbMATH OpenOpenAlexFDO

Authors Alexander J. Benavides, Antony Vera

Publication date 9 November 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2021.05.014

zbMATH Keywords

flow shopheuristicsmakespanschedulingtiebreaker

Mathematics Subject Classification ID

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

Recommendations

• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
• Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Cites work

• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• A comprehensive review and evaluation of permutation flowshop heuristics
• A Friedman-Type Rank Test for Main Effects in a Two-Factor ANOVA
• A high quality solution constructive heuristic for flow shop sequencing
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An empirical analysis of the optimality rate of flow shop heuristics
• An improved NEH heuristic to minimize makespan in permutation flow shops
• An improved NEH-based heuristic for the permutation flowshop problem
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Benchmarks for basic scheduling problems
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• New hard benchmark for flowshop scheduling problems minimising makespan
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• The Reversibility Property of Production Lines

Cited in

(5)

• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
• A reverse point algorithm for the assignment problem of the assignment of jobs with less number persons than jobs
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions

This page was built for publication: The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem

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