Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
DOI10.1016/J.TCS.2013.02.017zbMATH Open1302.90094OpenAlexW2089205020MaRDI QIDQ393040FDOQ393040
Authors: 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
Recommendations
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Minimizing total weighted completion time on parallel unbounded batch machines
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
- A PTAS for minimizing the total weighted completion time on identical parallel machines.
- Scheduling fully parallel jobs with integer parallel units
- Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
- Scheduling identical parallel machines to minimize total weighted completion time
- Maximizing the minimum completion time on parallel machines
- Minimizing the weighted number of tardy jobs on parallel processors
- Minimizing total weighted completion time approximately for the parallel machine problem with a single server
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Algorithms for Scheduling Independent Tasks
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Scheduling independent tasks to reduce mean finishing time
- Title not available (Why is that?)
- Order scheduling in an environment with dedicated resources in parallel
- 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
- 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
Cited In (6)
- Scheduling fully parallel jobs
- A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
- Scheduling fully parallel jobs with integer parallel units
- Resource scheduling with supply constraint and linear cost
- Minimizing total completion time on parallel machines with unit length jobs that need one additional resource
- Packing-based branch-and-bound for discrete malleable task scheduling
This page was built for publication: Minimizing the total weighted completion time of 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 Q393040)
