arrow
Return

OPTIMAL RESOURCE LEVELING USING NON-SERIAL DYNAMIC-PROGRAMMING

delete1994-10-01
delete89
PRE
AI
M
M. Bandelloni *
M
Mario Tucci
R
Rinaldo Rinaldi
DOI:10.1016/0377-2217(94)90380-8delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
A recurring problem in managing project activities is to minimize the deviation between the resource requirements and stated desirable levels. This paper presents a new optimizing approach for resource leveling based on non-serial dynamic programming. This approach permits a marked reduction of the complexity of the problem as it checks for only the feasible time subsets which are far less numerous than feasible sequences. The model, which is applied to an activity-on-node network, requires as input the scheduling results provided by the critical path method (CPM). Applications of the model to two opposite cases are also described and the solutions compared with the ones achieved by the Burges and Killebrew heuristic. Computational results indicate that the procedure provides exact solutions for small to medium size problems, requiring only modest computing facilities.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
8.1W

Organization

No organization information available
Cited Papers

Cited Papers

err2003-01-01
err0
PREAI
errI. Neuweiler; S. Attinger; W. Kinzelbach; P. King
errShare
errSave
CCD: Efficient Customized Content Dissemination in Distributed Publish/Subscribe
err2009-01-01
err0
errOAAI
errHojjat Jafarpour; Bijit Hore; Sharad Mehrotra; Nalini Venkatasubramanian
errShare
errSave
Effects of Co-Inoculation with Arbuscular Mycorrhizal Fungi and Rhizobia on Fungal Occupancy in Chickpea Root and Nodule Determined by Real-Time PCR
err2011-05-22
err0
PREAI
errAlireza Tavasolee; Naser Aliasgharzad; Gholam Reza Salehi; Mohsen Mardi; Ahmad Asgharzadeh; Sepide Akbarivala
errShare
errSave