de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Schliessen
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Werk suchen
On scheduling with setup times / vorgelegt von Alexander Mäcker. Paderborn, 2019
Inhalt
Introduction
Outline of the Thesis and Results
Discussion of the Problems and Approaches
Preliminaries
Approximation and Online Algorithms
Basic Techniques
Some Probability Theory
Scheduling on Machines with Setup Times
A General Model
Related Work
Scheduling on Identical Machines with Setup Times
Model & Notation
Simple Approaches
A (32+)-Approximation Algorithm
An Online Variant
Scheduling on Heterogeneous Machines with Setup Times
Model & Notation
Unrelated Machines
Special Cases of Unrelated Machines
Uniformly Related Machines
Offline Scheduling for Maximum Flow Time on a Machine with Setup Times
Model & Notation
Basic Properties and Observations
Approximation Algorithm
Online Scheduling for Maximum Flow Time on a Machine with Setup Times
Model, Notation & Notions
A Non-Clairvoyant Online Algorithm
Competitive Analysis
Smoothed Competitive Analysis
Cost-efficient Scheduling on Machines from the Cloud
Model & Notation
Related Work
Our Results
Simple Lower and Upper Bounds
A Batch-Style Competitive Algorithm
Conclusion & Outlook
Scheduling on Machines from the Cloud
Scheduling with Setup Times
Future Directions
Bibliography
Die detaillierte Suchanfrage erfordert aktiviertes Javascript.