Project scheduling with irregular costs: complexity, approximability, and algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1979515
- The project scheduling problem with irregular starting time costs
- On project scheduling with irregular starting time costs
- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
- Approximation algorithms for the discrete time-cost tradeoff problem
Cites work
- scientific article; zbMATH DE number 3661085 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- A Dynamic Programming Algorithm for Decision CPM Networks
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A decomposition theorem for partially ordered sets
- Approximation algorithms for the discrete time-cost tradeoff problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Hardness of approximation of the discrete time-cost tradeoff problem
- Network flows. Theory, algorithms, and applications.
- On project scheduling with irregular starting time costs
- Optimal design of centralized computer networks
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The Recognition of Series Parallel Digraphs
- The discrete time-cost tradeoff problem revisited
- The poset scheduling problem
- The project scheduling problem with irregular starting time costs
Cited in
(9)- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- scientific article; zbMATH DE number 1979515 (Why is no real title available?)
- Approximating the discrete time-cost tradeoff problem with bounded depth
- Approximating the discrete time-cost tradeoff problem with bounded depth
- The project scheduling problem with irregular starting time costs
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- A reduction tree approach for the discrete time/cost trade-off problem
- On project scheduling with irregular starting time costs
This page was built for publication: Project scheduling with irregular costs: complexity, approximability, and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707495)
