Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

We consider the deadline problem and budget problem of the nonlinear time–cost tradeoff project scheduling model in a series–parallel activity network. We develop fully polynomial-time approximation schemes for both problems using K -approximation sets and functions, together with series and paralle...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 37; no. 4; pp. 239 - 244
Main Authors:	Halman, Nir, Li, Chung-Lun, Simchi-Levi, David
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.07.2009 Elsevier
Subjects:	Applied sciences Approximation algorithms Exact sciences and technology Inventory control, production control. Distribution Operational research and scientific management Operational research. Management science Project management Scheduling, sequencing Time–cost tradeoff Time–cost tradeoff Approximation algorithms Project management Costs Time-cost tradeoff Polynomial approximation Deadline Scheduling Approximation algorithm Function approximation Modeling Polynomial time Budget Planning
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!