Collaborative flow-shop scheduling using simulated annealing and first price sealed bid auction to minimize total cost and make-span
收藏DataCite Commons2022-07-14 更新2025-04-16 收录
下载链接:
https://dataverse.telkomuniversity.ac.id/citation?persistentId=doi:10.34820/FK2/GIMMFJ
下载链接
链接失效反馈官方服务:
资源简介:
This work proposes a new flow-shop scheduling model that consists of several flow-shops. Every flowshop acts as an independent entity, but there is a collaboration among them. Although the relation between flow-shops and their customers is exclusive, collaboration through production sharing is possible.
提供机构:
Telkom University Dataverse
创建时间:
2022-07-14



