Minimizing the total weighted completion time of fully parallel jobs with integer parallel units

DOI10.1016/j.tcs.2013.02.017zbMath1302.90094OpenAlexW2089205020MaRDI QIDQ393040

Weiwei Wu, Minming Li, Qiang Zhang

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.017

zbMATH Keywords

algorithmsmachine schedulinginteger parallel unitsparallel jobsweighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Scheduling Fully Parallel Jobs with Integer Parallel Units ⋮ Scheduling fully parallel jobs ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the sum of weighted completion times in a concurrent open shop
• Order scheduling in an environment with dedicated resources in parallel
• A note on the complexity of the concurrent open shop problem
• The communication requirements of efficient allocations and supporting prices
• A PTAS for minimizing the weighted sum of job completion times on parallel machines
• An improved approximation algorithm for combinatorial auctions with submodular bidders
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Algorithms for Scheduling Independent Tasks
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Order Scheduling Models: Hardness and Algorithms

This page was built for publication: Minimizing the total weighted completion time of fully parallel jobs with integer parallel units