A Constant-Factor Approximation for Generalized Malleable Scheduling under M#-Concave Processing Speeds

• 成果类型: Article
• 署名作者: Fotakis, Dimitris; Matuschke, Jannik; Papadigenopoulos, Orestis
• 署名单位: National Technical University of Athens; KU Leuven; Columbia University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-023-02054-z
• 发表日期: 2024
• 页码: 515-539
• 关键词: quay crane allocation; algorithms; berth

摘要

In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required processing time for each job is determined by the joint processing speed of the allocated machines. We study the case that processing speeds are job-dependent M-#-concave functions and provide a constant-factor approximation for this setting, significantly expanding the realm of functions for which such an approximation is possible. Further, we explore the connection between malleable scheduling and the problem of fairly allocating items to a set of agents with distinct utility functions, devising a black-box reduction that allows to obtain resource-augmented approximation algorithms for the latter.