Collaborative flow-shop scheduling using simulated annealing and first price sealed bid auction to minimize total cost and make-span

10.34820/FK2/GIMMFJ Purba Daru Kusuma(Telkom University)Ratna Astuti Nugrahaeni(Telkom University) Collaborative flow-shop scheduling using simulated annealing and first price sealed bid auction to minimize total cost and make-span Telkom University Dataverse 2022 doi:10.34820/FK2/GIMMFJ/AP56S8 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. DARU KUSUMA, PURBA(fakultas teknik elektro - rekayasa komputer)