A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs

DOI10.1016/J.EJOR.2015.02.022MaRDI QIDQ319449zbMATH OpenOpenAlexFDO

Authors Byung-Cheon Choi, Myoung-Ju Park

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

zbMATH Keywords

computational complexityproject schedulingtime-cost tradeoffcompletely ordered jobs

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• A linear time-cost tradeoff problem with multiple milestones under a comb graph
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A network flow computation for project cost curves
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Concurrent Crashing and Overlapping in Product Development
• Critical Path Problems with Concave Cost-Time Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• Introduction to algorithms
• Optimum Time Compression in Project Scheduling
• 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

(8)

• Scheduling two projects with controllable processing times in a single-machine environment
• Considering project management activities for engineering design groups
• Complexity results for 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
• 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

This page was built for publication: A continuous 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 Q319449)