Approximating schedules

MaRDI QIDQ2711195zbMATH OpenFDO

Authors P. Schuurman

Publication date 6 May 2001

zbMATH Keywords

approximation algorithmsNP-completenessoptimal algorithmspipelined operator tree problempreemptive schedulingschedulingsingle-machine problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 830382
• scientific article; zbMATH DE number 724323
• scientific article; zbMATH DE number 1167865
• Models and algorithms of time-dependent scheduling
• Polynomial time approximation algorithms for machine scheduling: Ten open problems

Cited in

(1)

• Optimal scheduling combinatorics

This page was built for publication: Approximating schedules

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