Optimal project compression with due-dated events

DOI10.1002/NAV.3800260213zbMATH Open0401.90058OpenAlexW1995254656MaRDI QIDQ4186072FDOQ4186072

Authors: Salah E. Elmaghraby, P. Simin Pulat 

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)

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Title not available (Why is that?)

Cited In (6)

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

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

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