A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Timedoi:10.34820/FK2/DC4WZPTelkom University Dataverse2022-07-141Purba Daru Kusuma; Abduh Sayid Albana, 2022, "A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time", https://doi.org/10.34820/FK2/DC4WZP, Telkom University Dataverse, V1A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Timedoi:10.34820/FK2/DC4WZPPurba Daru KusumaAbduh Sayid AlbanaTelkom University DataverseDARU KUSUMA, PURBADARU KUSUMA, PURBA2022-07-14Computer and Information ScienceThis work aims to minimize intermediate storage with a tolerable maximum completion time level. In this work, the proposed model was developed by using an evolutionary algorithm (EA).CC0 Waiver10.22266/ijies2021.1231.41P. D. Kusuma and A. S. Albana, "A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time", International Journal of Intelligent Engineering and Systems, 14(6), 464-475, 2021.ijies_published_parallelflowshop.pdfapplication/pdf