scientific article; zbMATH DE number 7529517
From MaRDI portal
Publication:5077804
Recommendations
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic
- scientific article; zbMATH DE number 3974707
- The parameterized approximability of TSP with deadlines
- On the optimality of exact and approximation algorithms for scheduling problems
- scientific article; zbMATH DE number 2090597
- On the optimality of Feautrier's scheduling algorithm
- Reoptimization of the metric deadline TSP
- A branch and bound algorithm for minimizing weighted completion times with deadlines
- Approximation Algorithms for Scheduling Problems with Exact Delays
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3207751 (Why is no real title available?)
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
- A Dynamic Programming Algorithm for Decision CPM Networks
- A Simple CPM Time-Cost Tradeoff Algorithm
- A network flow computation for project cost curves
- Approximation algorithms for the discrete time-cost tradeoff problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Critical Path Problems with Concave Cost-Time Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Introduction to algorithms
- Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm”
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- The discrete time-cost tradeoff problem revisited
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077804)
