Minimizing the total completion time for a class of semi-online single machine scheduling problems

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-06-16 DOI:10.1016/j.tcs.2025.115422

Hajar Nouinou , Taha Arbaoui , Alice Yaloui

引用次数: 0

Abstract

Semi-online single machine scheduling problems with information on jobs' processing times and the objective to minimize the total completion time are considered. In these problems, a set of jobs arriving over time are to be scheduled on a single machine and their characteristics become known only upon arrival. Some of the studied problems are shown to have the same competitive ratio as the online problem and online scheduling algorithms can be applied. Given some constraints on the processing times of successive jobs, new lower bounds can be achieved and a new semi-online algorithm, called ϕD-SPT, is presented along with its competitive analysis.

查看原文本刊更多论文

一类半在线单机调度问题的总完成时间最小化

考虑了具有工件加工时间信息和总完成时间最小化目标的半在线单机调度问题。在这些问题中，一组随时间到达的作业被安排在一台机器上，它们的特征只有在到达时才知道。研究表明，有些问题与在线问题具有相同的竞争比，可以应用在线调度算法。给定对连续作业的处理时间的一些限制，可以实现新的下界，并提出了一种新的半在线算法，称为ϕD-SPT，并对其进行了竞争分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

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

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.