- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Bremen, Universität Bremen, Dissertation, 2020
- Keyword
-
Reihenfolgeproblem
Online-Algorithmus
Kombinatorische Optimierung
Scheduling
Gemischt-ganzzahlige Optimierung
Unsicherheit
- Event
-
Veröffentlichung
- (where)
-
Bremen
- (who)
-
Staats- und Universitätsbibliothek Bremen
- (when)
-
2020
- Creator
-
Eberle, Franziska
- Contributor
- DOI
-
10.26092/elib/436
- URN
-
urn:nbn:de:gbv:46-elib46394
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Eberle, Franziska
- Megow, Nicole
- Gupta, Anupam
- Staats- und Universitätsbibliothek Bremen
Time of origin
- 2020
Other Objects (12)
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
Matching and packing problems – optimization under uncertainty in theory and practice
Scheduling under uncertainty: Bounding the makespan distribution
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Scheduling under Uncertainty: Optimizing Against a Randomizing Adversary
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
Matching and packing problems – optimization under uncertainty in theory and practice
Scheduling under uncertainty: Bounding the makespan distribution
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Scheduling under Uncertainty: Optimizing Against a Randomizing Adversary
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
Matching and packing problems – optimization under uncertainty in theory and practice
Scheduling under uncertainty: Bounding the makespan distribution
Natural intelligence for scheduling, planning and packing problems
Streaming Algorithms for Bin Packing and Vector Scheduling
Improved approximation algorithms for packing and scheduling problems
Scheduling under Uncertainty: Optimizing Against a Randomizing Adversary
Packing problems and project scheduling models: An integrated perspective
Approximation algorithms for scheduling and two-dimensional packing problems