Showing 1 - 10 of 547
We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness...
Persistent link: https://www.econbiz.de/10011558722
In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great...
Persistent link: https://www.econbiz.de/10011558760
We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...
Persistent link: https://www.econbiz.de/10010274309
Persistent link: https://www.econbiz.de/10000812641
Persistent link: https://www.econbiz.de/10000555221
Persistent link: https://www.econbiz.de/10000622829
Persistent link: https://www.econbiz.de/10000595984
Persistent link: https://www.econbiz.de/10000413394
Persistent link: https://www.econbiz.de/10000415938
Persistent link: https://www.econbiz.de/10000418052