A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time
收藏DataCite Commons2022-07-14 更新2025-04-16 收录
下载链接：
https://dataverse.telkomuniversity.ac.id/citation?persistentId=doi:10.34820/FK2/DC4WZP
下载链接
链接失效反馈官方服务：
资源简介：
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).
提供机构：
Telkom University Dataverse
创建时间：
2022-07-14
