Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/19676

Title: Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts
Authors: Rifai, Achmad P.
Dawal, Siti Zawiah Md
Zuhdi, Aliq
Aoyama, Hideki
Case, Keith
Keywords: Reentrant FMS scheduling
Multi loading
Unloading and shortcuts
Genetic algorithm
Crowding distance-based substitution
Issue Date: 2016
Publisher: © Springer-Verlag
Citation: RIFAI, A.P. ... et al, 2016. Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts. The International Journal of Advanced Manufacturing Technology, 82(9), pp.1527-1545.
Abstract: The scheduling problem in flexible manufacturing systems (FMS) environment with loop layout configuration has been shown to be a NP-hard problem. Moreover, the improvement and modification of the loop layout add to the difficulties in the production planning stage. The introduction of multi loading-unloading points and turntable shortcut resulted on more possible routes, thus increasing the complexity. This research addressed the reentrant FMS scheduling problem where jobs are allowed to reenter the system and revisit particular machines. The problem is to determine the optimal sequence of the jobs as well as the routing options. A modified genetic algorithm (GA) was proposed to generate the feasible solutions. The crowding distance-based substitution was incorporated to maintain the diversity of the population. A set of test was applied to compare the performance of the proposed approach with other methods. Further computational experiments were conducted to assess the significance of multi loading-unloading and shortcuts in reducing the makespan, mean flow time, and tardiness. The results highlighted that the proposed model was robust and effective in the scheduling problem for both small and large size problems.
Description: This article is closed access.
Sponsor: The authors would like to acknowledge the Japan International Cooperation Agency (JICA) project of the ASEAN University Network/the Southeast Asia Engineering Education Development Network (AUN/Seed-Net) and the Ministry of Higher Education for financial support under High Impact Research Grant UM.C/HIR/MOHE/ ENG/35 (D000035-16001).
Version: Published
DOI: 10.1007/s00170-015-7395-5
URI: https://dspace.lboro.ac.uk/2134/19676
Publisher Link: http://dx.doi.org/10.1007/s00170-015-7395-5
ISSN: 0268-3768
Appears in Collections:Closed Access (Mechanical, Electrical and Manufacturing Engineering)

Files associated with this item:

File Description SizeFormat
Repository Siti 2015.pdfPublished version1.97 MBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.