Sevast'yanov's algorithm for the flow-shop scheduling problem

DOI10.1016/0377-2217(94)00356-4zbMath0947.90591OpenAlexW2019054090MaRDI QIDQ1278200

Helena Ramalhinho Lourenço

Publication date: 8 November 2000

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00356-4

zbMATH Keywords

heuristicsscheduling theorycomputational analysis

Mathematics Subject Classification ID

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

Related Items (6)

An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ A note on scheduling flowshops with flexible stage ordering ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Performance guarantees for flowshop heuristics to minimize makespan

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• A new heuristic for the n-job, M-machine flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• A Dynamic Programming Approach to Sequencing Problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• The Lessons of Flowshop Scheduling Research
• On general routing problems
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Sevast'yanov's algorithm for the flow-shop scheduling problem