The following pages link to (Q5501839):
Displaying 5 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
