Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

DOI10.1287/OPRE.2021.2198zbMath1505.90060arXiv2004.00518OpenAlexW4226540506MaRDI QIDQ5060512

Javad Ghaderi, Mehrnoosh Shafiee

Publication date: 10 January 2023

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.00518

zbMATH Keywords

approximation algorithmsscheduling algorithmsdata-parallel computingdatacenters

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Uses Software

• Apache Spark
• Unnamed Item

Cites Work

• Unnamed Item
• Minimizing the sum of weighted completion times in a concurrent open shop
• Approximation algorithms for scheduling unrelated parallel machines
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling subject to resource constraints: Classification and complexity
• Resource constrained scheduling on multiple machines
• Better Approximation Guarantees for Job-Shop Scheduling
• Convex quadratic and semidefinite programming relaxations in scheduling
• Coordinated scheduling of customer orders for quick response
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Preemptive Weighted Completion Time Scheduling of Parallel Jobs
• On Representatives of Subsets
• Scheduling Unrelated Machines by Randomized Rounding
• A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
• Improved bounds for scheduling conflicting jobs with minsum criteria
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
• Order Scheduling Models: Hardness and Algorithms
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

This page was built for publication: Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints