.png){kind=icon}
返回
Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2018.1497312.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of parallel-machine scheduling with machine-dependent slack (SLK) due-window assignment in the multitasking environment, which exists in various application domains such as Internet services, project management, and manufacturing. Motivated by practical observations, we extend the original model of multitasking to a more general model where each job's interruption proportion depends on the job itself and its processing position. In the light of individualised service, we consider SLK due-window assignment. Our objective is to minimise the total cost that comprises the earliness, tardiness, and due-window-related costs. Finding that an optimal schedule exists when each machine is occupied by at least one job, we show that the problem is polynomially solvable. We provide a more efficient solution algorithm for a special case of the problem. Finally, we present numerical examples to illustrate the application of the theoretical results and working of the solution algorithms.
Keyword:
multitasking
scheduling
SLK due-window
assignment
parallel machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Scheduling a maintenance activity and due-window assignment based on common flow allowance根据公共流量津贴安排维护活动和到期窗口分配
PREAI
分享收藏Three Attacks on the Mediated Semi‐Quantum Key Distribution without Invoking Quantum Measurement
PREAI
分享收藏
查看更多内容