Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
From MaRDI portal
Publication:5183257
DOI10.1287/opre.21.6.1250zbMath0274.90020OpenAlexW2129582326MaRDI QIDQ5183257
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.6.1250
Related Items (13)
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Minimizing total tardiness in permutation flowshops ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ Generating improved dominance conditions for the flowshop problem ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ A heuristic algorithm to schedule work in the repair industry ⋮ A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Flowshop scheduling research after five decades ⋮ Two models for a family of flowshop sequencing problems
This page was built for publication: Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
