A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell

The present research addresses the single transportation robot used to alleviate problems of robotic cell scheduling of the machines. For the purpose of minimizing the make-span, a model of mixed-integer linear programming (MILP) has been suggested. Since the inefficiency exists in NP-hard, a decomp...

詳細記述

書誌詳細

主要な著者:	Mohammad Reza Komari Alaei, Mehmet Soysal, Atabak Elmi, Audrius Banaitis, Nerija Banaitiene, Reza Rostamzadeh, Shima Javanmard
フォーマット:	Artigo
言語:	Inglês
出版事項:	MDPI AG 2021-07-01
シリーズ:	Mathematics
主題:	parallel machine robotic cell scheduling problem (CSP) mixed integer linear programming (MILP) Benders’ decomposition method logic-based Benders’ decomposition
オンライン･アクセス:	https://www.mdpi.com/2227-7390/9/15/1730
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!