A note on the online hierarchical scheduling for lp-norm load balancing

IF 1 3区数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-02-27 DOI:10.1016/j.dam.2025.02.029

Xianglai Qi, Lingfa Lu, Shiguo Zhou

引用次数: 0

Abstract

In this paper, we consider the online hierarchical scheduling for load balancing on two identical machines. In the problem, the jobs are available online over list and the objective is to minimize the

l_{p}

-norm of every machine’s load. A best possible online algorithm is designed for this problem.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

IF 1.1 3区数学Discrete Applied MathematicsPub Date : 2012-01-01 DOI: 10.1016/j.dam.2011.09.007

Gong Chen , Zhongxun Zhu

On the number of maximal independent sets in minimum colorings of split graphs

IF 1.1 3区数学Discrete Applied MathematicsPub Date : 2018-10-01 DOI: 10.1016/j.dam.2018.03.083

Boštjan Brešar , Nazanin Movarraei

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.

期刊最新文献

Bounds on the Aα-spectral radius of uniform hypergraphs with some vertices deleted Preprocessing complexity for some graph problems parameterized by structural parameters Pareto-scheduling of two competing agents with total weighted tardiness being one criterion On disjunction convex hulls by big-M lifting Grundy packing coloring of graphs