A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time

10.34820/FK2/DC4WZP Purba Daru Kusuma(Telkom University)Abduh Sayid Albana(Institut Teknologi Telkom Surabaya) A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time Telkom University Dataverse 2022 doi:10.34820/FK2/DC4WZP/G5ATS5 This 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). DARU KUSUMA, PURBA(fakultas teknik elektro - rekayasa komputer)