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/DC4WZPPurba Daru KusumaTelkom UniversityAbduh Sayid AlbanaAbduh SayidAlbanaInstitut Teknologi Telkom SurabayaA Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion TimeTelkom University Dataverse2022Computer and Information ScienceDARU KUSUMA, PURBAfakultas teknik elektro - rekayasa komputer2022-07-142022-07-1410.22266/ijies2021.1231.41436842application/pdf1.0CC0 WaiverThis 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).