A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
type: Item
instance of: scholarly article
title: A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
zbMATH Open document ID: 1545.90065
author: Ilan Reuven Cohen
author: Izack Cohen
author: Iyar Zaks
published in: Annals of Operations Research
publication date: 2024-08-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7897700
zbMATH Keywords: scheduling
zbMATH Keywords: capacitated machines
zbMATH Keywords: cloud computing
zbMATH Keywords: parallel machines
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
cites work: A robust optimization approach for the multi-mode resource-constrained project scheduling problem
cites work: Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
cites work: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
cites work: The consecutive multiprocessor job scheduling problem
cites work: Q4238573
cites work: Weighted completion time minimization for capacitated parallel machines
cites work: An adaptive robust optimization model for parallel machine scheduling
cites work: Weighted Flowtime on Capacitated Machines
cites work: Q4198056
cites work: Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
cites work: Scheduling parallel jobs on heterogeneous platforms
cites work: Maximizing the total profit of rectangles packed into a rectangle
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: A Review for Submodular Optimization on Machine Scheduling Problems
cites work: Exact algorithms to minimize makespan on single and parallel batch processing machines
cites work: The Design of Approximation Algorithms
DOI: 10.1007/S10479-023-05613-X
description: scientific article; zbMATH DE number 7897700