Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Year of publication: |
1998
|
---|---|
Authors: | Drexl, Andreas ; Kimms, Alf |
Publisher: |
Kiel : Universität Kiel, Institut für Betriebswirtschaftslehre |
Subject: | Scheduling-Verfahren | Dynamische Optimierung | Theorie | Total weighted completion time objective | precedence constraints | dynamic programming |
-
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
Drexl, Andreas, (1998)
-
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
Rostami, Salim, (2017)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
- More ...
-
Optimization guided lower and upper bounds for the resource investment problem
Drexl, Andreas, (1998)
-
Belastungsorientierte Just-in-Time Variantenfließfertigung
Drexl, Andreas, (1999)
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
- More ...