A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Timehttps://doi.org/10.34820/FK2/DC4WZPPurba Daru KusumaAbduh Sayid AlbanaTelkom University Dataverse2022-07-142022-07-14T11:46:53ZThis 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).Computer and Information ScienceP. 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., doi, 10.22266/ijies2021.1231.41DARU KUSUMA, PURBA2022-07-14CC0CC0 Waiver