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/XWCBMVDARU KUSUMA, PURBATelkom University Dataverse2023-10-052023-10-05T04:32:32ZA Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion TimeEngineeringschedulinghttps://inass.org/wp-content/uploads/2021/10/2021123141.pdfDARU KUSUMA, PURBA2022-04-12CC0CC0 Waiver