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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Mohammad Reza Komari Alaei, Mehmet Soysal, Atabak Elmi, Audrius Banaitis, Nerija Banaitiene, Reza Rostamzadeh, Shima Javanmard
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2021-07-01
Edice:	Mathematics
Témata:	parallel machine robotic cell scheduling problem (CSP) mixed integer linear programming (MILP) Benders’ decomposition method logic-based Benders’ decomposition
On-line přístup:	https://www.mdpi.com/2227-7390/9/15/1730
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!