Optimal project compression with due-dated events

DOI10.1002/NAV.3800260213zbMath0401.90058OpenAlexW1995254656MaRDI QIDQ4186072

P. Simin Pulat, Salah E. Elmaghraby

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260213

zbMATH Keywords

AlgorithmProject PlanningDue-Dated EventsOptimal Project Compression

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A network flow algorithm for just-in-time project scheduling ⋮ Activity nets: A guided tour through some recent developments ⋮ A bicriterion approach to time/cost trade-offs in sequencing ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ A new approach based on the surrogating method in the project time compression problems

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item

This page was built for publication: Optimal project compression with due-dated events