亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Efficient Project Scheduling with Autonomous Learning Opportunities

计算机科学 调度(生产过程) 运筹学 数学优化 数学
作者
Alessandro Hill,Thomas Vossen
出处
期刊:Informs Journal on Computing
标识
DOI:10.1287/ijoc.2023.0107
摘要

We consider novel project scheduling problems in which the experience gained from completing selected activities can be used to accelerate subsequent activities. Given a set of potential learning opportunities, our model aims to identify the opportunities that result in a maximum reduction of the project makespan when scheduled in sequence. Accounting for the impact of such learning opportunities causes significant complications, due to the cyclic nature of the learning relations and their interference with the precedence network. We propose additive and subtractive algorithms that iteratively reschedule the project using an enhanced topological sorting algorithm. Learning opportunities are integrated, activated, and potentially deactivated in each step by maintaining the acyclicity of the combined precedence and learning network. To illustrate the challenges that arise in this setting, we first consider the special case where activities can learn from at most one other activity. Subsequently, we extend our approach to the general case that admits multiple learning opportunities. We show that our approaches guarantee the construction of an optimal solution in polynomial time. In a computational study using 340 small and large resource-unconstrained PSPlib instances, we analyze the model behavior under various scenarios of learning intensity and learning opportunity. We demonstrate that significant project speedups can be obtained when proactively accounting for learning opportunities. History: Accepted by Pascal van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0107 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0107 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
简因完成签到 ,获得积分10
26秒前
43秒前
48秒前
大个应助Nill采纳,获得10
48秒前
leo完成签到 ,获得积分10
1分钟前
1分钟前
量子星尘发布了新的文献求助10
1分钟前
dagangwood完成签到 ,获得积分10
1分钟前
Hanzoe应助oleskarabach采纳,获得10
2分钟前
rpe完成签到,获得积分10
2分钟前
科研小白完成签到 ,获得积分10
2分钟前
英俊的铭应助Swait采纳,获得10
2分钟前
4分钟前
Swait发布了新的文献求助10
4分钟前
量子星尘发布了新的文献求助10
4分钟前
小新小新完成签到 ,获得积分10
5分钟前
5分钟前
Nill发布了新的文献求助10
5分钟前
量子星尘发布了新的文献求助30
6分钟前
bruna驳回了Hayat应助
6分钟前
6分钟前
sc发布了新的文献求助10
7分钟前
大模型应助Nill采纳,获得10
7分钟前
Suagy应助sc采纳,获得10
7分钟前
8分钟前
北斗发布了新的文献求助10
8分钟前
隐形曼青应助北斗采纳,获得10
8分钟前
sc完成签到,获得积分20
8分钟前
8分钟前
swg发布了新的文献求助10
8分钟前
嘻嘻完成签到,获得积分10
8分钟前
9分钟前
www完成签到,获得积分10
9分钟前
量子星尘发布了新的文献求助10
9分钟前
红橙黄绿蓝靛紫111完成签到,获得积分10
9分钟前
科研通AI5应助吴门烟水采纳,获得10
10分钟前
爆米花应助Sience采纳,获得10
10分钟前
10分钟前
量子星尘发布了新的文献求助20
11分钟前
11分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
网络安全 SEMI 标准 ( SEMI E187, SEMI E188 and SEMI E191.) 1000
Inherited Metabolic Disease in Adults: A Clinical Guide 500
计划经济时代的工厂管理与工人状况(1949-1966)——以郑州市国营工厂为例 500
INQUIRY-BASED PEDAGOGY TO SUPPORT STEM LEARNING AND 21ST CENTURY SKILLS: PREPARING NEW TEACHERS TO IMPLEMENT PROJECT AND PROBLEM-BASED LEARNING 500
The Pedagogical Leadership in the Early Years (PLEY) Quality Rating Scale 410
Why America Can't Retrench (And How it Might) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 催化作用 遗传学 冶金 电极 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 4611818
求助须知:如何正确求助?哪些是违规求助? 4017250
关于积分的说明 12436143
捐赠科研通 3699213
什么是DOI,文献DOI怎么找? 2040014
邀请新用户注册赠送积分活动 1072811
科研通“疑难数据库(出版商)”最低求助积分说明 956522