Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems

DOI10.1057/JORS.1990.55MaRDI QIDQ3202130zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in The 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

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

Recommendations

• The three dimensional bottleneck assignment problem and its variants
• The three-dimensional bottleneck assignment problem with capacity constraints
• Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems
• scientific article; zbMATH DE number 4131951
• Publication:3471838

Cited in

(9)

• The three-dimensional bottleneck assignment problem with capacity constraints
• A lexi-search algorithm for a time minimizing assignment problem.
• Task preference-based bottleneck assignment problem
• scientific article; zbMATH DE number 4131951 (Why is no real title available?)
• scientific article; zbMATH DE number 4139475 (Why is no real title available?)
• The three dimensional bottleneck assignment problem and its variants
• Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems
• 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

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