Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom
From MaRDI portal
Publication:3912344
DOI10.1080/02522667.1980.10698659zbMath0462.90043MaRDI QIDQ3912344
No author found.
Publication date: 1980
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1980.10698659
project scheduling; solution procedure; extreme point mathematical programming; assignment constraint; critical path problem
90C35: Programming involving graphs or networks
90C90: Applications of mathematical programming
90B35: Deterministic scheduling theory in operations research
Related Items
An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, A branch and bound algorithm for extreme point mathematical programming problems, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A finite algorithm for solving the generalized lattice point problem
Cites Work