Minimizing total late work on a single machine with generalized due-dates

不可用 动态规划 单机调度 数学优化 调度(生产过程) 计算机科学 总成本 作业车间调度 时间复杂性 数学 算法 到期日 统计 地铁列车时刻表 经济 微观经济学 操作系统
作者
Gur Mosheiov,Daniel Oron,Dvir Shabtay
出处
期刊:European Journal of Operational Research [Elsevier BV]
卷期号:293 (3): 837-846 被引量:28
标识
DOI:10.1016/j.ejor.2020.12.061
摘要

We study single machine scheduling problems with generalized due-dates. The scheduling measure is minimum total late work. We show that unlike the classical version (assuming job-specific due-dates), this problem has a polynomial time solution. Then, the problem is extended to allow job rejection. First, an upper bound on the total permitted rejection cost is assumed. Then we study the setting whereby the rejection cost is part of the objective function, which becomes minimizing the sum of total late work and rejection cost. We prove that both versions are NP-hard, and introduce pseudo-polynomial dynamic programming solution algorithms. We then consider a setting in which the machine is not available for some period (e.g., due to maintenance). Again, a pseudo-polynomial dynamic programming is introduced for the (NP-hard) problem of minimizing total late work with generalized due-dates and unavailability period. These dynamic programming algorithms are tested numerically, and proved to perform well on problems of various input parameters. Then, the extension to the weighted case, i.e., the problem of minimizing total weighted late work with generalized due-dates is proved to be NP-hard. Finally, we study a slightly different setting, in which the given due-dates are assigned to jobs, but there is no restriction on their order, i.e., the j-th due-date is not necessarily assigned to the j-th job in the sequence. We show that this problem (known as scheduling assignable due-dates) to minimize total late work is NP-hard as well.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Sun_Chen完成签到,获得积分10
刚刚
体贴凌柏发布了新的文献求助10
1秒前
成就的笑南完成签到 ,获得积分10
1秒前
2秒前
2秒前
wyw123完成签到,获得积分10
2秒前
求大佬帮助完成签到,获得积分10
2秒前
李健的小迷弟应助zyq采纳,获得10
3秒前
陈隆完成签到,获得积分10
3秒前
哎呀完成签到 ,获得积分10
3秒前
量子星尘发布了新的文献求助10
4秒前
mary完成签到,获得积分10
4秒前
4秒前
朱成豪发布了新的文献求助10
6秒前
deallyxyz应助科研通管家采纳,获得10
6秒前
科目三应助科研通管家采纳,获得10
6秒前
大个应助科研通管家采纳,获得10
6秒前
比比谁的速度快应助曾珍采纳,获得50
6秒前
6秒前
予修应助科研通管家采纳,获得10
6秒前
搜集达人应助科研通管家采纳,获得10
6秒前
wanci应助科研通管家采纳,获得30
6秒前
6秒前
6秒前
吹雪完成签到,获得积分0
6秒前
美好的尔白完成签到,获得积分10
6秒前
O-M175完成签到,获得积分10
7秒前
Jasper应助hahaha123213123采纳,获得10
7秒前
可爱的函函应助天天向上采纳,获得10
8秒前
陈隆完成签到,获得积分10
12秒前
12秒前
高乾飞完成签到 ,获得积分10
13秒前
河大青椒完成签到,获得积分10
13秒前
丘比特应助动听的秋白采纳,获得10
14秒前
晒黑的雪碧完成签到,获得积分10
15秒前
yao chen完成签到,获得积分10
16秒前
catch完成签到,获得积分10
16秒前
Hrx完成签到,获得积分10
16秒前
哎呀哎呀25完成签到,获得积分10
17秒前
20秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038368
求助须知:如何正确求助?哪些是违规求助? 3576068
关于积分的说明 11374313
捐赠科研通 3305780
什么是DOI,文献DOI怎么找? 1819322
邀请新用户注册赠送积分活动 892672
科研通“疑难数据库(出版商)”最低求助积分说明 815029