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)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
ylyla完成签到,获得积分10
1秒前
1秒前
完美世界应助上善若水采纳,获得10
2秒前
2秒前
万能图书馆应助MM采纳,获得10
3秒前
3秒前
人福药业发布了新的文献求助20
3秒前
上官若男应助asda采纳,获得10
3秒前
4秒前
4秒前
5秒前
干净的涵山完成签到 ,获得积分10
5秒前
5秒前
hei发布了新的文献求助10
6秒前
帅帅完成签到,获得积分10
6秒前
6秒前
研友_VZG7GZ应助123采纳,获得10
6秒前
ru完成签到 ,获得积分10
7秒前
Pamburger发布了新的文献求助10
7秒前
916应助吞吞采纳,获得10
7秒前
8秒前
dudu发布了新的文献求助10
8秒前
清脆的巧凡应助汤飞柏采纳,获得20
8秒前
wanci应助ln采纳,获得10
9秒前
9秒前
难难难发布了新的文献求助10
9秒前
10秒前
fanfan发布了新的文献求助10
11秒前
11秒前
lxy完成签到,获得积分10
11秒前
QQ发布了新的文献求助10
11秒前
优雅泡芙发布了新的文献求助20
12秒前
zj发布了新的文献求助10
12秒前
飞云发布了新的文献求助10
12秒前
满意花生发布了新的文献求助10
12秒前
汉堡包应助落寞冬云采纳,获得10
13秒前
13秒前
陈先生完成签到,获得积分10
13秒前
善良的猪咪完成签到,获得积分10
13秒前
13秒前
高分求助中
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Effective Learning and Mental Wellbeing 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3974856
求助须知:如何正确求助?哪些是违规求助? 3519400
关于积分的说明 11198085
捐赠科研通 3255563
什么是DOI,文献DOI怎么找? 1797860
邀请新用户注册赠送积分活动 877208
科研通“疑难数据库(出版商)”最低求助积分说明 806219