A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems

DOI10.1287/OPRE.23.1.118zbMath0326.90031OpenAlexW2151306129MaRDI QIDQ4091702

Spencer B. Smith, Ergin Uskup

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.118

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

On the Modeling Tactics of Research Extensions in Production/Operations Management ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ A MILP model for then-job,M-stage flowshop with sequence dependent set-up times ⋮ Impact of sequence-dependent setup time on job shop scheduling performance ⋮ An approximate solution of the flow-shop problem with sequence dependent setup times ⋮ Scheduling under machine breakdown in a continuous process industry ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Flowshop scheduling research after five decades

This page was built for publication: A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems