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

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

Full description

Bibliographic Details
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:
parallel machine
robotic cell scheduling problem (CSP)
mixed integer linear programming (MILP)
Benders’ decomposition method
logic-based Benders’ decomposition
Online Access:https://www.mdpi.com/2227-7390/9/15/1730
id doaj-0bfca82bcf994c0a8eab7ebe60af3c36
record_format Article
spelling doaj-0bfca82bcf994c0a8eab7ebe60af3c362021-08-06T15:28:14ZengMDPI AGMathematics2227-73902021-07-0191730173010.3390/math9151730A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic CellMohammad Reza Komari Alaei0Mehmet Soysal1Atabak Elmi2Audrius Banaitis3Nerija Banaitiene4Reza Rostamzadeh5Shima Javanmard6Department of Business Administration, Hacettepe University, 06800 Beytepe, Ankara, TurkeyDepartment of Business Administration, Hacettepe University, 06800 Beytepe, Ankara, TurkeySchool of Information Technology, Deakin University, Geelong, VIC 3220, AustraliaDepartment of Construction Management and Real Estate, Vilnius Gediminas Technical University, 10223 Vilnius, LithuaniaDepartment of Construction Management and Real Estate, Vilnius Gediminas Technical University, 10223 Vilnius, LithuaniaDepartment of Management, Urmia Branch, Islamic Azad University, Urmia, IranDepartment of Industrial Engineering, Eqbal Lahoori Institute of Higher Education, Mashhad, IranThe 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.https://www.mdpi.com/2227-7390/9/15/1730parallel machinerobotic cell scheduling problem (CSP)mixed integer linear programming (MILP)Benders’ decomposition methodlogic-based Benders’ decomposition
collection DOAJ
language English
format Article
sources DOAJ
author Mohammad Reza Komari Alaei
Mehmet Soysal
Atabak Elmi
Audrius Banaitis
Nerija Banaitiene
Reza Rostamzadeh
Shima Javanmard
spellingShingle Mohammad Reza Komari Alaei
Mehmet Soysal
Atabak Elmi
Audrius Banaitis
Nerija Banaitiene
Reza Rostamzadeh
Shima Javanmard
A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
Mathematics
parallel machine
robotic cell scheduling problem (CSP)
mixed integer linear programming (MILP)
Benders’ decomposition method
logic-based Benders’ decomposition
author_facet Mohammad Reza Komari Alaei
Mehmet Soysal
Atabak Elmi
Audrius Banaitis
Nerija Banaitiene
Reza Rostamzadeh
Shima Javanmard
author_sort Mohammad Reza Komari Alaei
title A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
title_short A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
title_full A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
title_fullStr A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
title_full_unstemmed A Bender’s Algorithm of Decomposition Used for the Parallel Machine Problem of Robotic Cell
title_sort bender’s algorithm of decomposition used for the parallel machine problem of robotic cell
publisher MDPI AG
series Mathematics
issn 2227-7390
publishDate 2021-07-01
description 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.
topic parallel machine
robotic cell scheduling problem (CSP)
mixed integer linear programming (MILP)
Benders’ decomposition method
logic-based Benders’ decomposition
url https://www.mdpi.com/2227-7390/9/15/1730
work_keys_str_mv AT mohammadrezakomarialaei abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT mehmetsoysal abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT atabakelmi abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT audriusbanaitis abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT nerijabanaitiene abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT rezarostamzadeh abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT shimajavanmard abendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT mohammadrezakomarialaei bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT mehmetsoysal bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT atabakelmi bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT audriusbanaitis bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT nerijabanaitiene bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT rezarostamzadeh bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
AT shimajavanmard bendersalgorithmofdecompositionusedfortheparallelmachineproblemofroboticcell
_version_ 1721217881351389184

Similar Items