A Comparative Study of Flow-Shop Algorithms
From MaRDI portal
Publication:4065271
DOI10.1287/opre.23.1.62zbMath0307.90037OpenAlexW2151127440MaRDI QIDQ4065271
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.1.62
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ The interface of buffer design and cyclic scheduling decisions in deterministic flow lines ⋮ Unnamed Item ⋮ Two-stage flowshop scheduling with a common second-stage machine ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ An adaptive branching rule for the permutation flow-shop problem ⋮ A Lagrangean relaxation approach for the mixed-model flow line sequencing problem ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ Flow shop-sequencing problem with synchronous transfers and makespan minimization ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ A heuristic algorithm to schedule work in the repair industry ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Minimization of the makespan in a two-machine problem under given resource constraints ⋮ Branch and bound algorithm for the flow shop with multiple processors
