Approximation for Scheduling on Parallel Machines with Fixed Jobs or Unavailability Periods
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Scheduling Problems - New Applications and Trends - Ed.: Da Rosa Righi, Rodrigo; - IntechOpen : InTech
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2020
- Urheber
-
Grigoriu, Liliana
- DOI
-
10.14279/depositonce-9978
- Handle
-
11303/11089
- URN
-
urn:nbn:de:101:1-2020051309453117113864
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:02 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
- Grigoriu, Liliana
- Technische Universität Berlin
Entstanden
- 2020
Ähnliche Objekte (12)
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Approximation schemes for scheduling problems
Approximation and randomization in scheduling
Approximation Schemes for Machine Scheduling
Scheduling unrelated machines by randomized rounding
Stochastic Online Scheduling on Parallel Machines
Iterative approximation of fixed points
Approximation algorithms for scheduling with reservations.
Approximation in batch and multiprocessor scheduling
Scheduling coupled tasks on parallel identical machines
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Approximation schemes for scheduling problems
Approximation and randomization in scheduling
Approximation Schemes for Machine Scheduling
Scheduling unrelated machines by randomized rounding
Stochastic Online Scheduling on Parallel Machines
Iterative approximation of fixed points
Approximation algorithms for scheduling with reservations.
Approximation in batch and multiprocessor scheduling
Scheduling coupled tasks on parallel identical machines
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Approximation schemes for scheduling problems
Approximation and randomization in scheduling
Approximation Schemes for Machine Scheduling
Scheduling unrelated machines by randomized rounding
Stochastic Online Scheduling on Parallel Machines
Iterative approximation of fixed points
Approximation algorithms for scheduling with reservations.
Approximation in batch and multiprocessor scheduling