Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom

DOI10.1080/02522667.1980.10698659zbMath0462.90043OpenAlexW2274943401MaRDI 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

zbMATH Keywords

project schedulingsolution procedureextreme point mathematical programmingassignment constraintcritical path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

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 ⋮ An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

Cites Work

• Extreme Point Mathematical Programming

This page was built for publication: Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom