Project scheduling with irregular costs: Complexity, approximability, and algorithms

DOI10.1007/3-540-36136-7_34MaRDI QIDQ4427859zbMATH OpenFDO

Authors Alexander Grigoriev, Gerhard J. Woeginger

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180381.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Project scheduling with irregular costs: complexity, approximability, and algorithms
• The project scheduling problem with irregular starting time costs
• On project scheduling with irregular starting time costs
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Approximation algorithms for the discrete time-cost tradeoff problem

Cited in

(5)

• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
• The project scheduling problem with irregular starting time costs
• On project scheduling with irregular starting time costs
• An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
• Project scheduling with irregular costs: complexity, approximability, and algorithms

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 Q4427859)