4.3 Article

Coupled task scheduling with time-dependent processing times

期刊

JOURNAL OF SCHEDULING
卷 24, 期 2, 页码 223-236

出版社

SPRINGER
DOI: 10.1007/s10951-020-00675-2

关键词

Coupled task scheduling; Time-dependent processing time; Simple linear processing time; Dynamic program; Heuristic; Healthcare scheduling

资金

  1. UTS International Research Scholarship (IRS)
  2. UTS President's Scholarship (UTSP)
  3. Australian Research Council Discovery Early Career Researcher Award - Australian Government [DE170100234]

向作者/读者索取更多资源

The study focuses on the single machine coupled task scheduling problem, aiming to minimize the makespan with identical processing time and delay period for the first task, and time-dependent processing time for the second task. This approach can be applied to model and solve certain healthcare appointment scheduling problems.
The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for all jobs, and the time-dependent processing time setting for the second task. Certain healthcare appointment scheduling problems can be modeled as the coupled task scheduling problem. Also, the incorporation of time-dependent processing time for the second task lets the human resource fatigue and the deteriorating health conditions be modeled. We provide optimal solution under certain conditions. In addition, we propose a dynamic program under the condition that the majority of jobs share the same time-dependent characteristic. We develop a heuristic for the general case and show that the heuristic performs well.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据