Scheduling with non-renewable resources: minimizing the sum of completion times

Author:

Bérczi KristófORCID,Király Tamás,Omlor Simon

Abstract

AbstractWe consider single-machine scheduling with a non-renewable resource. In this setting, we are given a set of jobs, each characterized by a processing time, a weight, and a resource requirement. At fixed points in time, certain amounts of the resource are made available to be consumed by the jobs. The goal is to assign the jobs non-preemptively to time slots on the machine, so that each job has enough resource available at the start of its processing. The objective that we consider is the minimization of the sum of weighted completion times. The main contribution of the paper is a PTAS for the case of 0 processing times ($$1|rm=1,p_j=0|\sum w_jC_j$$ 1 | r m = 1 , p j = 0 | w j C j ). In addition, we show strong NP-hardness of the case of unit resource requirements and weights ($$1|rm=1,a_j=1|\sum C_j$$ 1 | r m = 1 , a j = 1 | C j ), thus answering an open question of Györgyi and Kis. We also prove that the schedule corresponding to the Shortest Processing Time First ordering provides a 3/2-approximation for the latter problem. Finally, we investigate a variant of the problem where processing times are 0 and the resource arrival times are unknown. We present a $$(4+\epsilon )$$ ( 4 + ϵ ) -approximation algorithm, together with a $$(4-\varepsilon )$$ ( 4 - ε ) -inapproximability result, for any $$\varepsilon >0$$ ε > 0 .

Funder

Magyar Tudományos Akadémia

Nemzeti Kutatási Fejlesztési és Innovációs Hivatal

Nemzeti Kutatási, Fejlesztési és Innovaciós Alap

Publisher

Springer Science and Business Media LLC

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3