Showing 31 - 40 of 54
Persistent link: https://www.econbiz.de/10012125318
Persistent link: https://www.econbiz.de/10012157832
Persistent link: https://www.econbiz.de/10012158162
Persistent link: https://www.econbiz.de/10012214723
In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...
Persistent link: https://www.econbiz.de/10011737310
Persistent link: https://www.econbiz.de/10011757833
Persistent link: https://www.econbiz.de/10011740520
Persistent link: https://www.econbiz.de/10011784941
Persistent link: https://www.econbiz.de/10011818129
The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing a schedule for the set of its successors. The algorithm is motivated...
Persistent link: https://www.econbiz.de/10005080655