Sublinear Algorithms for Scheduling with Chain Precedence Constraints

Authors

Bin Fu, The University of Texas Rio Grande ValleyFollow
Yumei Huo, CUNY
Hairong Zhao, Purdue University

Document Type

Conference Proceeding

Publication Date

3-5-2025

Abstract

With the exponential growth of data in various applications, sublinear algorithms have become a new paradigm in computing for solving problems involving large amount datasets. In this paper, we study the classical parallel machine scheduling problem subject to chain precedence constraints where the processing times of jobs differ no more than a constant factor c. The objective is to minimize makespan. We develop the first streaming approximation algorithm when the number of chains is sublinear to the number of jobs. And for arbitrary number or chains, we develop the first randomized approximation scheme that runs in sublinear time.

Comments

© 2025 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

https://rdcu.be/eMBEZ

Recommended Citation

Fu, Bin, Yumei Huo, and Hairong Zhao. "Sublinear Algorithms for Scheduling with Chain Precedence Constraints." In International Computing and Combinatorics Conference, pp. 42-53. Singapore: Springer Nature Singapore, 2024. https://doi.org/10.1007/978-981-96-1090-7_4

Publication Title

Computing and Combinatorics

DOI

10.1007/978-981-96-1090-7_4