{"@context":"http://schema.org","@type":"Dataset","@id":"https://doi.org/10.34820/FK2/XWCBMV","identifier":"https://doi.org/10.34820/FK2/XWCBMV","name":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time","creator":[{"name":"DARU KUSUMA, PURBA","affiliation":"fakultas teknik elektro - rekayasa komputer"}],"author":[{"name":"DARU KUSUMA, PURBA","affiliation":"fakultas teknik elektro - rekayasa komputer"}],"datePublished":"2023-10-05","dateModified":"2023-10-05","version":"1","description":["A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time"],"keywords":["Engineering","scheduling"],"citation":[{"@type":"CreativeWork","@id":"https://inass.org/wp-content/uploads/2021/10/2021123141.pdf","identifier":"https://inass.org/wp-content/uploads/2021/10/2021123141.pdf"}],"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_published_parallelflowshop.pdf","fileFormat":"application/pdf","contentSize":436842,"@id":"https://doi.org/10.34820/FK2/XWCBMV/M8WHL7","identifier":"https://doi.org/10.34820/FK2/XWCBMV/M8WHL7","contentUrl":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/5952"}]}