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

DOI10.1287/OPRE.23.1.118MaRDI QIDQ4091702zbMATH OpenOpenAlexFDO

Authors Ergin Uskup, Spencer B. Smith

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) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091702)