Scheduling fully parallel jobs with integer parallel units

DOI10.1007/978-3-319-55911-7_11MaRDI QIDQ2988818zbMATH OpenOpenAlexFDO

Authors

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55911-7_11

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling fully parallel jobs
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
• A PTAS for minimizing the weighted sum of job completion times on parallel machines
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
• A PTAS for minimizing the total weighted completion time on identical parallel machines.

Cites work

• A note on the complexity of the concurrent open shop problem
• A PTAS for minimizing the weighted sum of job completion times on parallel machines
• Algorithms for Scheduling Independent Tasks
• scientific article; zbMATH DE number 1839475 (Why is no real title available?)
• 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 in an environment with dedicated resources in parallel
• Order Scheduling Models: Hardness and Algorithms
• Scheduling algorithms
• Scheduling independent tasks to reduce mean finishing time
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(3)

• Scheduling fully parallel jobs
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
• Approximation and Online Algorithms

This page was built for publication: Scheduling fully parallel jobs with integer parallel units

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988818)