Mara, Setyo Tri Windras and Sutoyo, Edi and Norcahyo, Rachmadi and Rifai, Achmad Pratama (2023) The job sequencing and tool switching problem with sequence-dependent set-up time. Journal of King Saud University - Engineering Sciences, 35 (1). pp. 53-61. ISSN 10183639
1-s2.0-S1018363921000386-main.pdf
Restricted to Registered users only
Download (906kB) | Request a copy
Abstract
Job sequencing and tool switching (SSP) is a well-known combinatorial optimization problem that aims to minimize the number of tool switches. The problem mainly arises in a flexible manufacturing system, in which machines can be configured with various tools to process different jobs and tool switches will reduce productivity. While the general studies assume uniform set-up time for tool switching, applications in the industries indicate that the set-up time of a tool might depend on the previously installed tool of the same slot. Therefore, this article proposes two integer linear programming models for the sequence-dependent SSP, namely, the five-index formulation and the multicommodity flow formulation. Experimental tests are executed to compare the sequence-dependent SSP with the uniform SSP, and the results show the effectiveness of multicommodity flow formulation. Finally, several managerial discussions are derived from the results.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Flexible manufacturing system,Job sequencing and tool switching,Sequence-dependent set-up time,Tool management |
Subjects: | T Technology > TJ Mechanical engineering and machinery |
Divisions: | Faculty of Engineering > Mechanical and Industrial Engineering Department |
Depositing User: | Rita Yulianti Yulianti |
Date Deposited: | 06 Jun 2024 03:05 |
Last Modified: | 06 Jun 2024 03:05 |
URI: | https://ir.lib.ugm.ac.id/id/eprint/299 |