Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems

DOI10.1137/S0895480198343418zbMath0962.90021OpenAlexW2014654532MaRDI QIDQ2706175

George Steiner, Paul Stephenson

Publication date: 19 March 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480198343418

zbMATH Keywords

branch and boundprecedence order

Mathematics Subject Classification ID

Partial orders, general (06A06) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Single machine batch scheduling with release times and delivery costs

This page was built for publication: Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems