Stochastic Online Scheduling Revisited (Q5505682)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 5498479

Language	Label	Description	Also known as
English	Stochastic Online Scheduling Revisited	scientific article; zbMATH DE number 5498479

Statements

scholarly article

0 references

Stochastic Online Scheduling Revisited (English)

0 references

Andreas S. Schulz

0 references

Combinatorial Optimization and Applications

0 references

publication date

27 January 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-85097-7_42

0 references

0 references

0 references

Approximation Techniques for Average Completion Time Scheduling

0 references

On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions

0 references

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates

0 references

LP-Based Online Scheduling: From Single to Parallel Machines

0 references

Single Machine Scheduling with Release Dates

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

0 references

On the optimality of static priority policies in stochastic scheduling on parallel machines

0 references

0 references

On-line scheduling to minimize average completion time revisited.

0 references

Models and Algorithms for Stochastic Online Scheduling

0 references

Approximation in Preemptive Stochastic Online Scheduling

0 references

Stochastic scheduling problems I — General strategies

0 references

Approximation in stochastic scheduling

0 references

Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds

0 references

Scheduling with Random Service Times

0 references

The power of \(\alpha\)-points in preemptive single machine scheduling.

0 references

Scheduling Unrelated Machines by Randomized Rounding

0 references

Stochastic Machine Scheduling with Precedence Constraints

0 references

0 references

Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime

0 references

Approximation results in parallel machines stochastic scheduling

0 references

Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-85097-7_42

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5505682

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5505682&oldid=35090421"