Deakin University
Browse
elmi-abendersalgorithmof-2021.pdf (938.89 kB)

A bender’s algorithm of decomposition used for the parallel machine problem of robotic cell

Download (938.89 kB)
Version 2 2024-06-05, 08:08
Version 1 2021-07-28, 15:07
journal contribution
posted on 2024-06-05, 08:08 authored by MRK Alaei, M Soysal, Atabak ElmiAtabak Elmi, A Banaitis, N Banaitiene, R Rostamzadeh, S Javanmard
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.

History

Journal

Mathematics

Volume

9

Article number

ARTN 1730

Pagination

1 - 15

Location

Basel, Switzerland

Open access

  • Yes

eISSN

2227-7390

Language

English

Publication classification

C1 Refereed article in a scholarly journal

Issue

15

Publisher

MDPI