scientific article; zbMATH DE number 1820024

MaRDI QIDQ3152807zbMATH OpenFDO

Authors Gerhard J. Woeginger

Publication date 23 October 2002

zbMATH Keywords

computational complexitymachine schedulingoff-line approximability

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 2156264
• The open shop scheduling problem
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Parameterized complexity of machine scheduling: 15 open problems
• scientific article; zbMATH DE number 3873052

Cited in

(16)

• Scheduling unit-length jobs with precedence constraints of small height
• Parameterized complexity of machine scheduling: 15 open problems
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Discussion on: ``Solving transient scheduling problems with constraint programming
• A survey of methods for the solution of problems of scheduling theory
• scientific article; zbMATH DE number 3883928 (Why is no real title available?)
• The open shop scheduling problem
• scientific article; zbMATH DE number 3968299 (Why is no real title available?)
• scientific article; zbMATH DE number 519878 (Why is no real title available?)
• scientific article; zbMATH DE number 2156264 (Why is no real title available?)
• Open Problem—M/G/1 Scheduling with Preemption Delays
• On the edge multicoloring of unicyclic graphs
• scientific article; zbMATH DE number 4189460 (Why is no real title available?)
• A historical note on the complexity of scheduling problems
• Reallocation problems in scheduling
• On a parallel machine scheduling problem with precedence constraints

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 Q3152807)