Scheduling the construction of value and discount weighted trees for maximum net present value
| Autor: | Marcus Brazil, Doreen A. Thomas, P. A. Grossman, J. H. Rubinstein |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Discounting 021103 operations research General Computer Science Present value Computer science 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Net present value Scheduling (computing) 020901 industrial engineering & automation Modeling and Simulation Combinatorial optimization |
| Zdroj: | Computers & Operations Research. 115:104578 |
| ISSN: | 0305-0548 |
| Popis: | Given a binary rooted tree in which each edge has an associated value and an associated discount factor, the problem addressed here is to determine which nodes should be visited and in what order so as to maximise the net present value calculated from the values and discount factors of the traversed edges. A process for determining which nodes to exclude is identified, some key properties of the solution are established, and an algorithm for generating an optimal sequence of nodes is presented. A key concept is the priority of a sequence of nodes, which is a certain function of the values and discount factors that determines whether the order of adjacent nodes in the sequence should be swapped. The problem was motivated by the need to determine an optimal sequence in which the network of access tunnels in an underground mine should be developed and the resources extracted when there is a limit on the equipment available. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect