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

DOI10.1016/0377-2217(94)00356-4MaRDI QIDQ1278200zbMATH OpenOpenAlexFDO

Authors Helena Ramalhinho Lourenço

Publication date 8 November 2000

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

computational analysisheuristicsscheduling theory

Mathematics Subject Classification ID

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

Recommendations

• A branch and bound algorithm for the flow-shop scheduling problem
• Approximability of flow shop scheduling
• Algorithms for a realistic variant of flowshop scheduling
• A heuristic search algorithm for flow-shop scheduling
• scientific article; zbMATH DE number 1500651
• scientific article; zbMATH DE number 1911010
• Some efficient heuristic methods for the flow shop sequencing problem
• Approximation algorithms for the parallel flow shop problem
• A comparative study of algorithms for the flowshop scheduling problem
• Worst-case analysis of an approximation algorithm for flow-shop scheduling

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A new heuristic for the n-job, M-machine flow-shop problem
• A new heuristic method for the flow shop sequencing problem
• An Evaluation of Flow Shop Sequencing Heuristics
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• scientific article; zbMATH DE number 432815 (Why is no real title available?)
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• On general routing problems
• Optimal two- and three-stage production schedules with set-up time included
• Some efficient heuristic methods for the flow shop sequencing problem
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• The Complexity of Flowshop and Jobshop Scheduling
• The Lessons of Flowshop Scheduling Research
• The Shifting Bottleneck Procedure for Job Shop Scheduling

Cited in

(6)

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

Describes a project that uses

Uses Software

• CPLEX

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

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