Cyclic scheduling of parts and robot moves in m-machine robotic cells. (February 2018)
- Record Type:
- Journal Article
- Title:
- Cyclic scheduling of parts and robot moves in m-machine robotic cells. (February 2018)
- Main Title:
- Cyclic scheduling of parts and robot moves in m-machine robotic cells
- Authors:
- Gultekin, Hakan
Coban, Betul
Akhlaghi, Vahid Eghbal - Abstract:
- Highlights: Multiple parts multi-unit robotic cell scheduling problem is considered. Mathematical programming formulation and parallel hybrid metaheuristics are developed. Heuristic algorithm provides near-optimal solutions in reasonable CPU time. Utilizing multi-unit cycles can increase the throughput by 20%. Abstract: We consider a flow shop type manufacturing cell consisting of m machines and a material handling robot producing multiple parts. The robot transfers the parts between the machines and loads/unloads the machines. We consider the cyclic scheduling of the parts and the robot moves with the objective of maximizing the throughput rate. We develop a mixed integer linear programming formulation of the problem. The formulation is improved with several valid inequalities and reformulations of the constraints. We also develop a hybrid metaheuristic algorithm for this strongly NP-Hard problem. The algorithm is modified to handle both 1-unit and multi-unit robot cycles. Multi-threading is used to parallelize the algorithm in order to improve its efficiency. After calibrating the parameters of the heuristic algorithm, an extensive computational study is performed to evaluate its performance. The results of this study revealed that the developed heuristic provides near-optimal solutions in reasonable solution times. The effects of parallelization and the benefits of considering multi-unit cycles instead of 1-unit cycles are also quantified. Our computational tests showHighlights: Multiple parts multi-unit robotic cell scheduling problem is considered. Mathematical programming formulation and parallel hybrid metaheuristics are developed. Heuristic algorithm provides near-optimal solutions in reasonable CPU time. Utilizing multi-unit cycles can increase the throughput by 20%. Abstract: We consider a flow shop type manufacturing cell consisting of m machines and a material handling robot producing multiple parts. The robot transfers the parts between the machines and loads/unloads the machines. We consider the cyclic scheduling of the parts and the robot moves with the objective of maximizing the throughput rate. We develop a mixed integer linear programming formulation of the problem. The formulation is improved with several valid inequalities and reformulations of the constraints. We also develop a hybrid metaheuristic algorithm for this strongly NP-Hard problem. The algorithm is modified to handle both 1-unit and multi-unit robot cycles. Multi-threading is used to parallelize the algorithm in order to improve its efficiency. After calibrating the parameters of the heuristic algorithm, an extensive computational study is performed to evaluate its performance. The results of this study revealed that the developed heuristic provides near-optimal solutions in reasonable solution times. The effects of parallelization and the benefits of considering multi-unit cycles instead of 1-unit cycles are also quantified. Our computational tests show that multi-unit cycles improve the throughput rate by 9% on the average. The improvement can reach to 20% depending on the problem parameters. … (more)
- Is Part Of:
- Computers & operations research. Volume 90(2018)
- Journal:
- Computers & operations research
- Issue:
- Volume 90(2018)
- Issue Display:
- Volume 90, Issue 2018 (2018)
- Year:
- 2018
- Volume:
- 90
- Issue:
- 2018
- Issue Sort Value:
- 2018-0090-2018-0000
- Page Start:
- 161
- Page End:
- 172
- Publication Date:
- 2018-02
- Subjects:
- Robotic cell scheduling -- Multiple parts -- Mixed integer linear programming formulation -- Hybrid metaheuristic -- Throughput maximization
Operations research -- Periodicals
Electronic digital computers -- Periodicals
004.05 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03050548 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cor.2017.09.018 ↗
- Languages:
- English
- ISSNs:
- 0305-0548
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.770000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 5060.xml