- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Improved Scheduling Algorithms for Minsum Criteria ; 1996, 509
Preprint Reihe Mathematik ; 1996, 509
- Klassifikation
-
Mathematik
- DOI
-
10.14279/depositonce-14311
- Handle
-
11303/15538
- URN
-
urn:nbn:de:101:1-2022011306510798073228
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 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.
Ähnliche Objekte (12)
Improved approximation algorithms for packing and scheduling problems
Efficient algorithms for production scheduling
New utilization criteria for online scheduling
New utilization criteria for online scheduling
Algorithms for deterministic and stochastic scheduling
Competitive Algorithms for Multistage Online Scheduling
Fast algorithms for two scheduling problems
Online algorithms for scheduling unit jobs
Scheduling Algorithms for the Smart Grid
Online Algorithms for Scheduling with Testing
Approximation algorithms for scheduling with reservations.
Energy-efficient scheduling algorithms
Improved approximation algorithms for packing and scheduling problems
Efficient algorithms for production scheduling
New utilization criteria for online scheduling
New utilization criteria for online scheduling
Algorithms for deterministic and stochastic scheduling
Competitive Algorithms for Multistage Online Scheduling
Fast algorithms for two scheduling problems
Online algorithms for scheduling unit jobs
Scheduling Algorithms for the Smart Grid
Online Algorithms for Scheduling with Testing
Approximation algorithms for scheduling with reservations.
Energy-efficient scheduling algorithms
Improved approximation algorithms for packing and scheduling problems
Efficient algorithms for production scheduling
New utilization criteria for online scheduling
New utilization criteria for online scheduling
Algorithms for deterministic and stochastic scheduling
Competitive Algorithms for Multistage Online Scheduling
Fast algorithms for two scheduling problems
Online algorithms for scheduling unit jobs
Scheduling Algorithms for the Smart Grid
Online Algorithms for Scheduling with Testing
Approximation algorithms for scheduling with reservations.