- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bremen, Universität Bremen, Dissertation, 2020
- Schlagwort
-
Reihenfolgeproblem
Online-Algorithmus
Kombinatorische Optimierung
Scheduling
Gemischt-ganzzahlige Optimierung
Unsicherheit
- Ereignis
-
Veröffentlichung
- (wo)
-
Bremen
- (wer)
-
Staats- und Universitätsbibliothek Bremen
- (wann)
-
2020
- Urheber
-
Eberle, Franziska
- Beteiligte Personen und Organisationen
- DOI
-
10.26092/elib/436
- URN
-
urn:nbn:de:gbv:46-elib46394
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Eberle, Franziska
- Megow, Nicole
- Gupta, Anupam
- Staats- und Universitätsbibliothek Bremen
Entstanden
- 2020
Ähnliche Objekte (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
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Approximation algorithms for scheduling and two-dimensional packing problems
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
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Approximation algorithms for scheduling and two-dimensional packing problems
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
Tight Approximation for Resource Constrained Scheduling and Bin Packing