A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
DOI10.1007/S10479-023-05613-XzbMATH Open1545.90065MaRDI QIDQ6588490
Iyar Zaks, Ilan Reuven Cohen, Izack Cohen
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling parallel jobs on heterogeneous platforms
- Maximizing the total profit of rectangles packed into a rectangle
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- A robust optimization approach for the multi-mode resource-constrained project scheduling problem
- Weighted completion time minimization for capacitated parallel machines
- An adaptive robust optimization model for parallel machine scheduling
- The consecutive multiprocessor job scheduling problem
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- The Design of Approximation Algorithms
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
- A Review for Submodular Optimization on Machine Scheduling Problems
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Weighted Flowtime on Capacitated Machines
This page was built for publication: A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588490)
