Calendarization of time planning in MPM networks

DOI10.1007/BF01415759zbMath0758.90048MaRDI QIDQ4015965

No author found.

Publication date: 12 November 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

calendarproject managementproduction managementtime planning

Mathematics Subject Classification ID

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

Related Items (3)

Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ Using constraint programming for solving RCPSP/MAX-cal ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems

Cites Work

• On a routing problem
• Algorithm 562: Shortest Path Lengths [H]

This page was built for publication: Calendarization of time planning in MPM networks