Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
From MaRDI portal
Publication:5183257
DOI10.1287/opre.21.6.1250zbMath0274.90020MaRDI 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
90B35: Deterministic scheduling theory in operations research
Related Items
Generating improved dominance conditions for the flowshop problem, Elimination conditions and lower bounds for the permutation flow-shop sequencing problem, Minimizing total tardiness in permutation flowshops, 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, Two models for a family of flowshop sequencing problems, Flowshop scheduling research after five decades, A new lower bounding rule for permutation flow shop scheduling, A heuristic algorithm to schedule work in the repair industry