A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
type: Item
instance of: scholarly article
title: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
zbMATH Open document ID: 1346.90334
author: Byung-Cheon Choi
author: Myoung-Ju Park
published in: European Journal of Operational Research
publication date: 2016-10-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6633545
zbMATH Keywords: project scheduling
zbMATH Keywords: time-cost tradeoff
zbMATH Keywords: computational complexity
zbMATH Keywords: completely ordered jobs
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2015.02.022
OpenAlex ID: W2084861261
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
cites work: Introduction to algorithms
cites work: Project scheduling. A research handbook.
cites work: Critical Path Problems with Concave Cost-Time Curves
cites work: Q5514188
cites work: A network flow computation for project cost curves
cites work: Q4198056
cites work: Critical-Path Planning and Scheduling: Mathematical Basis
cites work: Optimum Time Compression in Project Scheduling
cites work: Concurrent Crashing and Overlapping in Product Development
cites work: Project scheduling with finite or infinite number of activity processing modes -- a survey
DOI: 10.1016/J.EJOR.2015.02.022
description: scientific article; zbMATH DE number 6633545