A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
From MaRDI portal
Publication:319449
DOI10.1016/J.EJOR.2015.02.022zbMath1346.90334OpenAlexW2084861261MaRDI QIDQ319449
Myoung-Ju Park, Byung-Cheon Choi
Publication date: 6 October 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.2015.02.022
Abstract computational complexity for mathematical programming problems (90C60) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
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 ⋮ Considering project management activities for engineering design groups ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
Cites Work
- 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
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Concurrent Crashing and Overlapping in Product Development
- Optimum Time Compression in Project Scheduling
- Critical Path Problems with Concave Cost-Time Curves
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
