Stable scheduling of single machine with probabilistic parameters

Bulletin of the Polish Academy of Sciences. Technical Sciences

W. Bo?ejkoCorresponding authorDepartment of Control Systems and Mechatronics, Faculty of Electronics, Wroc?aw University of Science and Technology, Wyb. Wyspia?skiego, 50-370 Wroc?aw, PolandEmailOther articles by this author:De Gruyter OnlineGoogle Scholar¹  M. WodeckiInstitute of Computer Science, University of Wroc?aw, 15 Joliot-Curie St., 50-383 Wroc?aw, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar²  P. RajbaInstitute of Computer Science, University of Wroc?aw, 15 Joliot-Curie St., 50-383 Wroc?aw, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar² 

[1] Department of Control Systems and Mechatronics, Faculty of Electronics, Wroc?aw University of Science and Technology, Wyb. Wyspia?skiego, 50-370 Wroc?aw, Poland;Institute of Computer Science, University of Wroc?aw, 15 Joliot-Curie St., 50-383 Wroc?aw, Poland

关键词: Keywords: scheduling;    uncertain parameters;    tabu search;    stability;   

DOI  :  10.1515/bpasts-2017-0026

学科分类：工程和技术（综合）

来源: Polska Akademia Nauk * Centrum Upowszechniania Nauki / Polish Academy of Sciences, Center for the Advancement of Science

【 摘 要 】

We consider a stochastic variant of the single machine total weighted tardiness problem jobs parameters are independent random variables with normal or Erlang distributions. Since even deterministic problem is NP-hard, it is difficult to find global optimum for large instances in the reasonable run time. Therefore, we propose tabu search metaheuristics in this work. Computational experiments show that solutions obtained by the stochastic version of metaheuristics are more stable (i.e. resistant to data disturbance) than solutions generated by classic, deterministic version of the algorithm.

【 授权许可】

Unknown