Pages that link to "Item:Q5947304"
From MaRDI portal
The following pages link to Tighter bounds on preemptive job shop scheduling with two machines (Q5947304):
Displaying 6 items.
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)