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

DOI10.1007/S00236-004-0150-2zbMATH Open1158.90383DBLPjournals/acta/GrigorievW04OpenAlexW1989540884WikidataQ57338968 ScholiaQ57338968MaRDI QIDQ707495FDOQ707495

Authors: Alexander Grigoriev, Gerhard J. Woeginger 

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

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

zbMATH Keywords

NP-hardAPX-harddiscrete time-cost tradeoff problem

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Project scheduling. A research handbook.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The project scheduling problem with irregular starting time costs
• The Recognition of Series Parallel Digraphs
• On project scheduling with irregular starting time costs
• A decomposition theorem for partially ordered sets
• Approximation algorithms for the discrete time-cost tradeoff problem
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Title not available (Why is that?)
• The discrete time-cost tradeoff problem revisited
• Title not available (Why is that?)
• Hardness of approximation of the discrete time-cost tradeoff problem
• A Dynamic Programming Algorithm for Decision CPM Networks
• Title not available (Why is that?)
• The poset scheduling problem
• A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
• Optimal design of centralized computer networks

Cited In (9)

• Approximating the discrete time-cost tradeoff problem with bounded depth
• Approximating the discrete time-cost tradeoff problem with bounded depth
• Title not available (Why is that?)
• On project scheduling with irregular starting time costs
• A reduction tree approach for the discrete time/cost trade-off problem
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
• The project scheduling problem with irregular starting time costs
• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

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)