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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 37; číslo 4; s. 239 - 244
Hlavní autoři: Halman, Nir, Li, Chung-Lun, Simchi-Levi, David
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier B.V 01.07.2009
Elsevier
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 parallel reductions.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2009.03.002