Pages that link to "Item:Q4806605"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605):
Displaying 9 items.
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (Q1273117) (← links)
- Better approximation guarantees for job-shop scheduling (Q2706190) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127) (← links)
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)