A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time
收藏DataCite Commons2023-10-05 更新2025-04-16 收录
下载链接：
https://dataverse.telkomuniversity.ac.id/citation?persistentId=doi:10.34820/FK2/XWCBMV
下载链接
链接失效反馈官方服务：
资源简介：
A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time
一种采用两步进化算法（Two-Step Evolutionary Algorithm）的并行置换流水车间调度模型（Parallel Permutation Flow-Shop Scheduling Model）：在可容许最大完工时间（Maximum Completion Time）约束下最小化中间存储（Intermediate Storage）
提供机构：
Telkom University Dataverse
创建时间：
2022-04-12
