期刊
LOGIC JOURNAL OF THE IGPL
卷 31, 期 2, 页码 240-254出版社
OXFORD UNIV PRESS
DOI: 10.1093/jigpal/jzac016
关键词
job shop scheduling; total tardiness; interval uncertainty; robustness
This paper discusses a variant of the job shop scheduling problem that deals with uncertainty in task durations and due dates using interval modeling. Different ranking methods for intervals are explored and integrated into a genetic algorithm. A new measure of robustness is proposed to evaluate the ability of ranking methods to predict expected delays. Experimental results demonstrate that considering uncertainty during optimization leads to more robust solutions. Sensitivity analysis also indicates that the robustness of solutions improves as uncertainty increases.
This paper addresses a variant of the job shop scheduling problem with total tardiness minimization where task durations and due dates are uncertain. This uncertainty is modelled with intervals. Different ranking methods for intervals are considered and embedded into a genetic algorithm. A new robustness measure is proposed to compare the different ranking methods and assess their capacity to predict 'expected delays' of jobs. Experimental results show that dealing with uncertainty during the optimization process yields more robust solutions. A sensitivity analysis also shows that the robustness of the solutions given by the solving method increases when the uncertainty grows.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据