Arbeitspapier
Minimizing total weighted completion times subject to precedence constraints by dynamic programming
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 relevance of it. A computational study proves that large instances with up to 120 activities can be solved.
- Language
-
Englisch
- Bibliographic citation
-
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; No. 475
- Classification
-
Management
- Subject
-
Total weighted completion time objective
precedence constraints
dynamic programming
Scheduling-Verfahren
Dynamische Optimierung
Theorie
- Event
-
Geistige Schöpfung
- (who)
-
Drexl, Andreas
Kimms, Alf
- Event
-
Veröffentlichung
- (who)
-
Universität Kiel, Institut für Betriebswirtschaftslehre
ZBW – Leibniz Information Centre for Economics
- (where)
-
Kiel
- (when)
-
1998
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Drexl, Andreas
- Kimms, Alf
- Universität Kiel, Institut für Betriebswirtschaftslehre
- ZBW – Leibniz Information Centre for Economics
Time of origin
- 1998
Other Objects (12)
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Stochastic single machine scheduling to minimize the weighted expected flow time and maximum expected lateness subject to precedence constraints given by an OR network
Minimizing the makespan on a single machine subject to modular setups
Minimizing the makespan on a single machine subject to modular setups
158.-Precedence among Authors.
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Stochastic single machine scheduling to minimize the weighted expected flow time and maximum expected lateness subject to precedence constraints given by an OR network
Minimizing the makespan on a single machine subject to modular setups
Minimizing the makespan on a single machine subject to modular setups
158.-Precedence among Authors.
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
A PTAS for minimizing the total weighted completion time on identical parallel machines
Scheduling with non-renewable resources: minimizing the sum of completion times
Minimizing total completion time in large-sized pharmaceutical quality control scheduling
Approximation algorithms for coupled task scheduling minimizing the sum of completion times
Minimizing total completion time on a single machine with step improving jobs
Column generation for minimizing total completion time in a parallel-batching environment
Stochastic single machine scheduling to minimize the weighted expected flow time and maximum expected lateness subject to precedence constraints given by an OR network
Minimizing the makespan on a single machine subject to modular setups
Minimizing the makespan on a single machine subject to modular setups