scientific article; zbMATH DE number 6472638

MaRDI QIDQ5501840zbMATH OpenFDO

Authors

Publication date 14 August 2015

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cited in

(11)

• Off-line admission control for general scheduling problems
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• Approximation algorithms for shop scheduling problems with minsum objective
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• Metaheuristics for order scheduling problem with unequal ready times
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• Reoptimization in machine scheduling
• Designing PTASs for MIN-SUM scheduling problems
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• Improved online scheduling with restarts on a single machine
• Improved online scheduling with restarts on a single machine

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501840)