Project scheduling with irregular costs: complexity, approximability, and algorithms
From MaRDI portal
Publication:707495
DOI10.1007/s00236-004-0150-2zbMath1158.90383OpenAlexW1989540884WikidataQ57338968 ScholiaQ57338968MaRDI QIDQ707495
Gerhard J. Woeginger, Alexander Grigoriev
Publication date: 9 February 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/1191181/guid-9812f5ab-67c1-4030-8933-55d68e30e821-ASSET1.0.pdf
Related Items
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks, A reduction tree approach for the discrete time/cost trade-off problem, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs, Approximating the discrete time-cost tradeoff problem with bounded depth, Approximating the discrete time-cost tradeoff problem with bounded depth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The poset scheduling problem
- The discrete time-cost tradeoff problem revisited
- Project scheduling. A research handbook.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Hardness of approximation of the discrete time-cost tradeoff problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The project scheduling problem with irregular starting time costs
- A decomposition theorem for partially ordered sets
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- The Recognition of Series Parallel Digraphs
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A Dynamic Programming Algorithm for Decision CPM Networks
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Optimal design of centralized computer networks
- On project scheduling with irregular starting time costs
