Name
Abstract | ||
|---|---|---|
This paper considers the problem of minimizing resource investment required to execute the tasks in a project network by a given project due date. A project consists of non-pre-emptive tasks executed in a known and required precedence order. Each task is completed in one of its feasible modes, which may differ not only in task duration but also in consumption of renewable resources. A priority rule heuristic with polynomial computational complexity is presented for this computationally intractable problem. This heuristic simultaneously considers due date constraints and resource usage to select and schedule tasks with one decision rule. This differs from prior multi-mode priority rule scheduling heuristics that apply two consecutive decision rules to schedule tasks. Extensive computational testing indicates promising results. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1057/palgrave.jors.2601827 | JORS |
Keywords | Field | DocType |
computer science,communications technology,logistics,operations research,information systems,project management,reliability,forecasting,investment,marketing,location,scheduling,information technology,operational research,management science,production,inventory | Decision rule,Information system,Heuristic,Computer science,Scheduling (computing),Operations research,Purchasing,Project network,Management science,Operations management,Project management,Computational complexity theory | Journal |
Volume | Issue | ISSN |
56 | 4 | 0160-5682 |
Citations | PageRank | References |
13 | 0.71 | 3 |
Authors | ||
2 | ||