On the complexity of project scheduling to minimize exposed time

DOI10.1016/j.ejor.2014.02.013zbMath1304.90101OpenAlexW2037934049MaRDI QIDQ2514874

Vera Tilson, Edieal J. Pinker, Joseph G. Szmerekovsky

Publication date: 4 February 2015

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.013

zbMATH Keywords

project schedulingpolynomial algorithmNP-completecomplexity theorysecret project

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Project scheduling under the threat of catastrophic disruption ⋮ A priority based assignment problem ⋮ An alternate approach to solve two-level priority based assignment problem

Uses Software

• Quicksort

Cites Work

• Scheduling modular projects on a bottleneck resource
• Partially ordered knapsack and applications to scheduling
• Nash equilibria in competitive project scheduling
• A pegging approach to the precedence-constrained knapsack problem
• Interdicting a Nuclear-Weapons Project
• Project scheduling under competition
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Technical Note—Managing a Secret Project
• Quicksort
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of project scheduling to minimize exposed time