Partially concurrent open shop scheduling with preemption and limited resources

Keyphrases

• Open Shop Scheduling 100%
• Concurrent Open Shop 100%
• Preemption 100%
• Limited Resources 100%
• Graph Coloring 20%
• Clothing 20%
• Scheduling Problem 20%
• Scheduling Model 20%
• Conflict Graph 20%
• Open Shop Scheduling Problem 20%
• Polynomial-time Algorithm 20%
• Vertex Coloring 20%
• Additional Resources 20%
• Colour Classes 20%
• Resource Binding 20%
• Perfect Graphs 20%

Mathematics

• Polynomial 100%
• Real Life 100%
• Graph Coloring 100%

Computer Science

• Scheduling Problem 100%
• Conflict Graph 50%
• Graph Coloring 50%
• Polynomial Algorithm 50%