A Comparative Study of Flow-Shop Algorithms
From MaRDI portal
Publication:4065271
DOI10.1287/OPRE.23.1.62zbMATH Open0307.90037OpenAlexW2151127440MaRDI QIDQ4065271FDOQ4065271
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) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cited In (18)
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
- Title not available (Why is that?)
- A new lower bounding rule for permutation flow shop scheduling
- A new integer programming formulation for the permutation flowshop problem
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- An adaptive branching rule for the permutation flow-shop problem
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Minimization of the makespan in a two-machine problem under given resource constraints
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- A heuristic algorithm to schedule work in the repair industry
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- The job shop scheduling problem: Conventional and new solution techniques
- Branch and bound algorithm for the flow shop with multiple processors
- The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
- Two-stage flowshop scheduling with a common second-stage machine
This page was built for publication: A Comparative Study of Flow-Shop Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065271)