Skip to main navigation
Skip to search
Skip to main content
Technical University of Munich Home
Help & FAQ
English
Deutsch
Home
Profiles
Research units
Projects
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Online Makespan Minimization with Parallel Schedules
Susanne Albers
, Matthias Hellwig
Informatics 14 - Chair of Algorithms and Complexity
Humboldt-Universität zu Berlin
Research output
:
Contribution to journal
›
Article
›
peer-review
16
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Online Makespan Minimization with Parallel Schedules'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Resource Augmentation
100%
Makespan Minimization
100%
Online Algorithms
66%
Competitive Algorithm
66%
Processing Time
33%
Parallel Processing
33%
Small Sets
33%
Scheduling Process
33%
Performance Guarantee
33%
Makespan
33%
Solution Set
33%
Multiple Solutions
33%
Competitive Ratio
33%
Job Sequencing
33%
Identical Parallel Machines
33%
Processing Environment
33%
Maximum Completion Time
33%
Job Processing
33%
Mathematics
Polynomial
100%
Minimizes
100%
Multiple Solution
100%
Competitive Ratio
100%
Small Set
100%
Main Result
100%
Computer Science
on-line algorithm
100%
Parallel Processing
50%
Scheduling Process
50%
Performance Guarantee
50%
Completion Time
50%
Classical Problem
50%
Parallel Machine
50%
Processing Time
50%
Competitive Ratio
50%