{"@context":"http://schema.org","@type":"Dataset","@id":"https://doi.org/10.34820/FK2/GIMMFJ","identifier":"https://doi.org/10.34820/FK2/GIMMFJ","name":"Collaborative flow-shop scheduling using simulated annealing and first price sealed bid auction to minimize total cost and make-span","creator":[{"name":"Purba Daru Kusuma","affiliation":"Telkom University"},{"name":"Ratna Astuti Nugrahaeni","affiliation":"Telkom University"}],"author":[{"name":"Purba Daru Kusuma","affiliation":"Telkom University"},{"name":"Ratna Astuti Nugrahaeni","affiliation":"Telkom University"}],"datePublished":"2022-07-14","dateModified":"2022-07-14","version":"1","description":["This work proposes a new flow-shop scheduling model that consists of several flow-shops. Every flow\u0002shop 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."],"keywords":["Computer and Information Science"],"citation":[{"@type":"CreativeWork","text":"P. D. Kusuma and R. A. Nugrahaeni, \"Collaborative flow-shop scheduling using simulated annealing and first price sealed bid auction to minimize total cost and make-span\", International Journal of Intelligent Engineering and Systems, 15(1), 530-539, 2022"}],"license":{"@type":"Dataset","text":"CC0","url":"https://creativecommons.org/publicdomain/zero/1.0/"},"includedInDataCatalog":{"@type":"DataCatalog","name":"Telkom University Dataverse","url":"https://dataverse.telkomuniversity.ac.id"},"publisher":{"@type":"Organization","name":"Telkom University Dataverse"},"provider":{"@type":"Organization","name":"Telkom University Dataverse"},"distribution":[{"@type":"DataDownload","name":"ijies_collaborativeflowshop_published.pdf","fileFormat":"application/pdf","contentSize":419960,"@id":"https://doi.org/10.34820/FK2/GIMMFJ/AP56S8","identifier":"https://doi.org/10.34820/FK2/GIMMFJ/AP56S8","contentUrl":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/8954"}]}