A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
| Autor: | Shima Javanmard, Reza Rostamzadeh, Audrius Banaitis, Atabak Elmi, Mohammad Reza Komari Alaei, Mehmet Soysal, Nerija Banaitiene |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Cell scheduling
0209 industrial biotechnology 021103 operations research mixed integer linear programming (MILP) Linear programming Computer science robotic cell scheduling problem (CSP) General Mathematics parallel machine 0211 other engineering and technologies 02 engineering and technology Benders’ decomposition method 020901 industrial engineering & automation logic-based Benders’ decomposition QA1-939 Computer Science (miscellaneous) Decomposition (computer science) In real life Robot Benders decomposition method Inefficiency Engineering (miscellaneous) Algorithm Mathematics |
| Zdroj: | Mathematics Volume 9 Issue 15 Mathematics, Vol 9, Iss 1730, p 1730 (2021) |
| ISSN: | 2227-7390 |
| Popis: | 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 decomposition algorithm posed by Bender was utilized to alleviate the problem in real life situations. The proposed algorithm can be regarded as an efficient attempt to apply optimality Bender’s cuts regarding the problem of parallel machine robotic cell scheduling in order to reach precise resolutions for medium and big sized examples. The numerical analyses have demonstrated the efficiency of the proposed solving approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |