{"@context":"http://schema.org","@type":"Dataset","@id":"https://doi.org/10.34820/FK2/DC4WZP","identifier":"https://doi.org/10.34820/FK2/DC4WZP","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":"Purba Daru Kusuma","affiliation":"Telkom University"},{"name":"Abduh Sayid Albana","affiliation":"Institut Teknologi Telkom Surabaya"}],"author":[{"name":"Purba Daru Kusuma","affiliation":"Telkom University"},{"name":"Abduh Sayid Albana","affiliation":"Institut Teknologi Telkom Surabaya"}],"datePublished":"2022-07-14","dateModified":"2022-07-14","version":"1","description":["This work aims to minimize intermediate storage with a tolerable maximum completion time level. In this work, the proposed model was developed by using an evolutionary algorithm (EA)."],"keywords":["Computer and Information Science"],"citation":[{"@type":"CreativeWork","text":"P. D. Kusuma and A. S. Albana, \"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time\", International Journal of Intelligent Engineering and Systems, 14(6), 464-475, 2021."}],"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/DC4WZP/G5ATS5","identifier":"https://doi.org/10.34820/FK2/DC4WZP/G5ATS5","contentUrl":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/8958"}]}