scientific article; zbMATH DE number 1820024

zbMATH Open1024.68009MaRDI QIDQ3152807FDOQ3152807

Authors: Gerhard J. Woeginger 

Publication date: 23 October 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexitymachine schedulingoff-line approximability

Mathematics Subject Classification ID

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

Cited In (15)

• A survey of methods for the solution of problems of scheduling theory
• Title not available (Why is that?)
• Open Problem—M/G/1 Scheduling with Preemption Delays
• Parameterized complexity of machine scheduling: 15 open problems
• Title not available (Why is that?)
• On a parallel machine scheduling problem with precedence constraints
• Title not available (Why is that?)
• A historical note on the complexity of scheduling problems
• Scheduling unit-length jobs with precedence constraints of small height
• The open shop scheduling problem
• Title not available (Why is that?)
• Discussion on: ``Solving transient scheduling problems with constraint programming
• On the edge multicoloring of unicyclic graphs
• Title not available (Why is that?)
• Reallocation problems in scheduling

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)