Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs

DOI10.1142/S0217595915500396zbMath1330.90027OpenAlexW2247835078MaRDI QIDQ3455883

Byung-Cheon Choi, Myoung-Ju Park

Publication date: 11 December 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595915500396

zbMATH Keywords

computational complexityproject schedulingtime-cost tradeoffuncertain processing times

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Linear programming (90C05) Production models (90B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Robust scheduling and robustness measures for the discrete time/cost trade-off problem
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• On the robust shortest path problem.
• Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
• Robust optimization-methodology and applications
• A Network Flow Computation for Project Cost Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• The stochastic time–cost tradeoff problem: A robust optimization approach
• Critical path planning under uncertainty
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Concurrent Crashing and Overlapping in Product Development

This page was built for publication: Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs