Scheduling fully parallel jobs
From MaRDI portal
Publication:2317138
DOI10.1007/S10951-018-0563-3zbMATH Open1420.90025OpenAlexW2802400846MaRDI QIDQ2317138FDOQ2317138
Authors: Yanyan Li 
Publication date: 8 August 2019
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-018-0563-3
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Algorithms for Scheduling Independent Tasks
- Scheduling independent tasks to reduce mean finishing time
- Scheduling semi-malleable jobs to minimize mean flow time
- Order scheduling in an environment with dedicated resources in parallel
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Title not available (Why is that?)
- Order Scheduling Models: Hardness and Algorithms
- Minimizing the sum of weighted completion times in a concurrent open shop
- A note on the complexity of the concurrent open shop problem
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Unrelated machine scheduling of jobs with uniform Smith ratios
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)
