Pages that link to "Item:Q1607979"
From MaRDI portal
The following pages link to Approximation algorithms for shop scheduling problems with minsum objective (Q1607979):
Displaying 13 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)