Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/94585
Title: | Novel robotic job-shop scheduling models with deadlock and robot movement considerations | Authors: | Sun, Y Chung, SH Wen, XW Ma, HL |
Issue Date: | May-2021 | Source: | Transportation research. Part E, Logistics and transportation review, May 2021, v. 149, 102273 | Abstract: | The robotic job-shop scheduling problem (RJSP) has become increasingly important due to the wide application of robots for material delivery in modern logistics and supply chain systems. With the common assumptions of negligible material transportation procedures and infinite machine buffers, the traditional job-shop scheduling problem (JSP) models can lead to system failures due to the potential deadlock for a robot-driven production line. In this study, we propose two novel robotic job-shop scheduling models with deadlock and robot movement considerations (RJSPDT). The proposed novel models simultaneously consider the scheduling of job operations and the movement of the robot, with the objective of minimizing makespan. In order to avoid deadlock, the machine blocking strategy is applied and a set of tight deadlock-avoidance constraints is proposed. Two modelling approaches are applied: the traditional position-based approach and the novel network-based approach which is inspired by aviation scheduling studies. Through numerical examples, it is illustrated that our proposed models can completely avoid transportation conflicts by considering deadlock and robot movement. Besides, through computational experiments, the network-based RJSPDT shows higher solution efficiency owing to the smaller model size than the position-based RJSPDT (e.g., reducing the computational time by 96% for small-scale problems). Moreover, we explore the impacts of job settings (e.g., number of jobs, number of operations in a job) and job entrance strategies (i.e., fixed entrance and flexible entrance) on model performances. Results show that the number of jobs imposes greater impacts than the number of operations in a job, while the fixed entrance strategy can reduce the average computational time by 60% with little impact on the makespan. | Keywords: | Deadlock Job-shop scheduling Machine blocking Mixed integer linear programming Robot movement Robot-driven production lines |
Publisher: | Pergamon Press | Journal: | Transportation research. Part E, Logistics and transportation review | ISSN: | 1366-5545 | EISSN: | 1878-5794 | DOI: | 10.1016/j.tre.2021.102273 | Rights: | © 2021 Elsevier Ltd. All rights reserved. © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. The following publication Sun, Y., Chung, S.-H., Wen, X., & Ma, H.-L. (2021). Novel robotic job-shop scheduling models with deadlock and robot movement considerations. Transportation Research Part E: Logistics and Transportation Review, 149, 102273 is available at https://dx.doi.org/10.1016/j.tre.2021.102273. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Sun_Novel_Robotic_Job-Shop.pdf | Pre-Published version | 2.88 MB | Adobe PDF | View/Open |
Page views
65
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
15
Citations as of Oct 13, 2024
SCOPUSTM
Citations
25
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
20
Citations as of Aug 22, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.