Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems

DOI10.1057/JORS.1990.55zbMath0715.90065OpenAlexW1993275288MaRDI QIDQ3202130

No author found.

Publication date: 1990

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.55

zbMATH Keywords

branch-and-bound-type algorithmsspecially structured precedence constraintsthree-dimensional, time-minimizing (bottleneck) assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

The three-dimensional bottleneck assignment problem with capacity constraints ⋮ The approximability of three-dimensional assignment problems with bottleneck objective ⋮ Assignment problems: a golden anniversary survey

This page was built for publication: Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems