Pages that link to "Item:Q3329209"
From MaRDI portal
The following pages link to Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling (Q3329209):
Displaying 11 items.
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Worst-case analysis of scheduling heuristics of parallel systems (Q1274368) (← links)
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
- A probabilistic analysis of multiprocessor list scheduling: the erlang case (Q3742709) (← links)
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling (Q3990102) (← links)
- A Heuristic of Scheduling Parallel Tasks and Its Analysis (Q3990654) (← links)
- Scheduling and due‐date quotation in a make‐to‐order supply chain (Q5393028) (← links)
- Update on the Asymptotic Optimality of LPT (Q6487184) (← links)
