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

Byung-Cheon Choi and Myoung-Ju Park

European Journal of Operational Research, 2015, vol. 244, issue 3, 748-752

Abstract: We consider a continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs. If a milestone is tardy, a penalty cost may be imposed. The processing times of jobs can be compressed by additional resources or activities that incur compression costs. The objective is to minimize the total penalty cost plus the total compression cost. We show that the problem is NP-hard, even if the compression cost is described as a concave function, and we present a pseudo-polynomial time algorithm for that case. Furthermore, we show that the problem is polynomially solvable if the compression cost function is convex.

Keywords: Project scheduling; Time–cost tradeoff; Computational complexity; Completely ordered jobs (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171500123X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:244:y:2015:i:3:p:748-752

DOI: 10.1016/j.ejor.2015.02.022

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().