Scheduling fully parallel jobs
From MaRDI portal
Publication:2317138
Recommendations
- Scheduling fully parallel jobs with integer parallel units
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Minimizing total weighted completion time on parallel unbounded batch machines
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
Cites work
- scientific article; zbMATH DE number 1839475 (Why is no real title available?)
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
- A note on the complexity of the concurrent open shop problem
- Algorithms for Scheduling Independent Tasks
- Minimizing the sum of weighted completion times in a concurrent open shop
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Order Scheduling Models: Hardness and Algorithms
- Order scheduling in an environment with dedicated resources in parallel
- Scheduling independent tasks to reduce mean finishing time
- Scheduling semi-malleable jobs to minimize mean flow time
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Unrelated machine scheduling of jobs with uniform Smith ratios
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cited in
(2)
This page was built for publication: Scheduling fully parallel jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317138)