A network flow algorithm for just-in-time project scheduling

DOI10.1016/0377-2217(94)90348-4zbMath0815.90094OpenAlexW1966751355MaRDI QIDQ1342048

Eugene Levner, Arkadi Nemirovski

Publication date: 11 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/2bf26b69-fdf0-4e05-b654-5c7a55c37993

zbMATH Keywords

project schedulingjust-in-timeout-of-kilter algorithmpseudo-linear complexity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (4)

The construction of stable project baseline schedules ⋮ A network flow algorithm for just-in-time project scheduling ⋮ A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling ⋮ A parametric critical path problem and an application for cyclic scheduling

Cites Work

• A network flow algorithm for just-in-time project scheduling
• PERT and crashing revisited: Mathematical generalizations
• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Optimal project compression with due-dated events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A network flow algorithm for just-in-time project scheduling