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...
Main Authors: | Mohammad Reza Komari Alaei, Mehmet Soysal, Atabak Elmi, Audrius Banaitis, Nerija Banaitiene, Reza Rostamzadeh, Shima Javanmard |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/15/1730 |
Similar Items
-
Accelerating benders decomposition with heuristicmaster problem solutions
by: Alysson M. Costa, et al.
Published: (2012-04-01) -
Accelerating benders decomposition with heuristicmaster problem solutions
by: Alysson M. Costa, et al.
Published: (2012-04-01) -
Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
by: Lin, Sifeng
Published: (2015) -
A Benders’ Decomposition Approach for Renewable Generation Investment in Distribution Systems
by: Sergio Montoya-Bueno, et al.
Published: (2020-03-01) -
Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
by: Karlsson, E., et al.
Published: (2022)