Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs

DOI10.1016/j.ejor.2013.11.009zbMath1338.90164OpenAlexW2008869735MaRDI QIDQ299837

Byung-Cheon Choi, Ji-Bok Chung

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.009

zbMATH Keywords

computational complexityproject schedulingchain precedence graphtime-cost tradeoff

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs ⋮ A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Project scheduling problem with fuzzy activity durations: a novel operational law based solution framework ⋮ A linear time-cost tradeoff problem with multiple milestones under a comb graph ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Project scheduling. A research handbook.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Faster algorithms for the shortest path problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Concurrent Crashing and Overlapping in Product Development

This page was built for publication: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs