arrow
返回

Dynamic scheduling with uncertain job types

delete2023-09-01
delete1
delete
OA
AI
Z
Zuo‐Jun Max Shen
J
Jingui Xie
Z
Zhichao Zheng
H
Han Zhou *
DOI:10.1016/j.ejor.2023.02.013delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Uncertain job types can arise as a result of predictive or diagnostic inaccuracy in healthcare or repair service systems and unknown preferences in matching service systems. In this paper, we study systems with multiple types of jobs, in which type information is imperfect and will be updated dynamically. Each job has a prior probability of belonging to a certain type which may be predicted by data, models, or experts. A job can only be processed by the right machine, and a job assigned to the wrong ma-chine must be rescheduled. More information is learned from the mismatch, and job type probabilities are updated. The question is how to dynamically schedule all jobs so that they can be processed in a timely fashion. We use a novel coupling and inductive method to conduct optimality analysis. We obtain the near-optimal policy regarding completion time, named the less-uncertainty-first policy, when there are two types of jobs; the insights it yields are used to develop heuristic algorithms for more general cases. We also consider other objectives, including the number of mismatches and the total amount of time jobs spend in the system. In our numerical study, we examine the performance of the proposed heuristics when there are more than two types of jobs under two learning schemes: dedicated learning and exclusive learning. In the extension, we also analyze an online version of the problem in which jobs arrive sequentially to the system and must be assigned immediately and irrevocably without any knowl-edge of future jobs. We analyze the competitive ratios of different scheduling policies and find similar insights. It is essential that managers dynamically schedule services by leveraging predictive information and knowledge learned from mismatches. Our proposed less-uncertainty-first policy, which accounts for system dynamics to avoid mismatches and resource idling, can be used to improve system efficiency in various contexts.(c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Uncertain job types
Predictive information
Learning
Mismatch and rescheduling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
University of California Berkeley
学者数:
3.5W
论文数: 2.8W
被引数: 11.3W
University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
T
Technical University of Munich
学者数:
5.2W
论文数: 3.9W
被引数: 6.2W
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Differences in Physical Activity Among Adults in Households With and Without Children
err2012-09-01
err0
PREAI
errJeanette I. Candelaria; James F. Sallis; Terry L. Conway; Brian E. Saelens; Lawrence D. Frank; Donald J. Slymen
err分享
err收藏
Anytime deduction for probabilistic logic
err1994-09-01
err0
PREAI
errAlan M. Frisch; Peter Haddawy
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Abnormal cardiac repolarization in anabolic androgenic steroid users carrying out submaximal exercise testing
err2010-11-29
err0
PREAI
errAlex S Maior; Pedro Menezes; Roberto C Pedrosa; Denise P Carvalho; Pedro Paulo Soares; Jose Hamilton M Nascimento
err分享
err收藏
学者 查看更多内容