arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.01252cs.AI
收藏

熟练工人约束下工单调度的快速探试法

A Swift Heuristic Method for Work Order Scheduling under the Skilled-Workforce Constraint

Scotia Bank(丰业银行);Quinnipiac University(昆尼皮亚克大学)

Nima Safaei, Corey Kiassat

摘要:

所考虑的问题是如何最佳地分配一组工作的技术人员的不同技能,使每种技能的技术人员的数量不超过该技能指定的人数。关键的动机是对劳动力规模进行快速敏感性分析,这在许多行业中存在意外工作订单时是非常必要的。提出了一个时间指标的数学模型,以最小化工件的加权完工时间之和。该模型被分解成一些单技能的子问题,使每一个是一系列嵌套的二进制背包问题的组合。一个启发式的过程中提出了解决问题。我们的实验结果,基于真实世界的案例研究,表明该方法快速产生一个时间表统计接近最优的,而经典的优化过程是非常耗时的。

英文摘要:

The considered problem is how to optimally allocate a set of jobs to technicians of different skills such that the number of technicians of each skill does not exceed the number of persons with that skill designation. The key motivation is the quick sensitivity analysis in terms of the workforce size which is quite necessary in many industries in the presence of unexpected work orders. A time-indexed mathematical model is proposed to minimize the total weighted completion time of the jobs. The proposed model is decomposed into a number of single-skill sub-problems so that each one is a combination of a series of nested binary Knapsack problems. A heuristic procedure is proposed to solve the problem. Our experimental results, based on a real-world case study, reveal that the proposed method quickly produces a schedule statistically close to the optimal one while the classical optimal procedure is very time-consuming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑