Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
DOI10.1016/J.EJOR.2013.11.009zbMATH Open1338.90164OpenAlexW2008869735MaRDI QIDQ299837FDOQ299837
Authors: Byung-Cheon Choi, Jibok 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
Recommendations
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
- A linear time-cost tradeoff problem with multiple milestones under a comb graph
- Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation Schemes for the Restricted Shortest Path Problem
- 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
- Faster algorithms for the shortest path problem
- Approximation algorithms for the discrete time-cost tradeoff problem
- A network flow computation for project cost curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Concurrent Crashing and Overlapping in Product Development
Cited In (10)
- Scheduling two projects with controllable processing times in a single-machine environment
- Title not available (Why is that?)
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
- A linear time-cost tradeoff problem with multiple milestones under a comb graph
- Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
- Single-machine scheduling of multiple projects with controllable processing times
- Simplifying the nonlinear continuous time-cost tradeoff problem
- Project scheduling problem with fuzzy activity durations: a novel operational law based solution framework
- Multimode time-cost-robustness trade-off project scheduling problem under uncertainty
This page was built for publication: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299837)
