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

DOI10.1016/J.EJOR.2013.11.009MaRDI QIDQ299837zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityproject schedulingchain precedence graphtime-cost tradeoff

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A network flow computation for project cost curves
• Approximation Schemes for the Restricted Shortest Path Problem
• Approximation algorithms for the discrete time-cost tradeoff problem
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Concurrent Crashing and Overlapping in Product Development
• Critical-Path Planning and Scheduling: Mathematical Basis
• Faster algorithms for the 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

Cited in

(10)

• Scheduling two projects with controllable processing times in a single-machine environment
• scientific article; zbMATH DE number 1979515 (Why is no real title available?)
• 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
• Simplifying the nonlinear continuous time-cost tradeoff problem
• Single-machine scheduling of multiple projects with controllable processing times
• 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

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)