{"dcterms:modified":"2023-10-06","dcterms:creator":"A Dataverse Instance","@type":"ore:ResourceMap","@id":"https://dataverse.telkomuniversity.ac.id/api/datasets/export?exporter=OAI_ORE&persistentId=doi:10.34820/FK2/XWCBMV","ore:describes":{"Title":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step  Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable  Maximum Completion Time","Subject":"Engineering","citation:Depositor":"DARU KUSUMA, PURBA","Deposit Date":"2022-04-12","citation:Keyword":{"keyword:Term":"scheduling"},"Related Publication":{"URL":"https://inass.org/wp-content/uploads/2021/10/2021123141.pdf"},"citation:Contact":{"datasetContact:Name":"DARU KUSUMA, PURBA","datasetContact:Affiliation":"fakultas teknik elektro - rekayasa komputer","datasetContact:E-mail":"purbodaru@telkomuniversity.ac.id"},"Author":{"author:Name":"DARU KUSUMA, PURBA","author:Affiliation":"fakultas teknik elektro - rekayasa komputer"},"citation:Description":{"dsDescription:Text":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step \nEvolutionary Algorithm to Minimize Intermediate Storage with Tolerable \nMaximum Completion Time","dsDescription:Date":"2022-04-12"},"@id":"doi:10.34820/FK2/XWCBMV","@type":["ore:Aggregation","schema:Dataset"],"schema:version":"1.0","schema:datePublished":"2023-10-05","schema:name":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time","schema:dateModified":"Thu Oct 05 11:32:32 WIB 2023","schema:license":"https://creativecommons.org/publicdomain/zero/1.0/","dvcore:fileTermsOfAccess":{"dvcore:fileRequestAccess":false},"schema:includedInDataCatalog":"PURBA DARU KUSUMA Flow Shop Scheduling","ore:aggregates":[{"schema:name":"ijies_published_parallelflowshop.pdf","dvcore:restricted":false,"schema:version":1,"dvcore:datasetVersionId":370,"@id":"doi:10.34820/FK2/XWCBMV/M8WHL7","schema:sameAs":"https://dataverse.telkomuniversity.ac.id/api/access/datafile/:persistentId?persistentId=doi:10.34820/FK2/XWCBMV/M8WHL7","@type":"ore:AggregatedResource","schema:fileFormat":"application/pdf","dvcore:filesize":436842,"dvcore:storageIdentifier":"file://1801d06d4af-1871b124e915","dvcore:rootDataFileId":-1,"dvcore:checksum":{"@type":"MD5","@value":"09f1d1d15bf9fac5b4d0e9c6d810aad0"}}],"schema:hasPart":["doi:10.34820/FK2/XWCBMV/M8WHL7"]},"@context":{"Author":"http://purl.org/dc/terms/creator","Deposit Date":"http://purl.org/dc/terms/dateSubmitted","Related Publication":"http://purl.org/dc/terms/isReferencedBy","Subject":"http://purl.org/dc/terms/subject","Title":"http://purl.org/dc/terms/title","URL":"https://schema.org/distribution","author":"https://dataverse.org/schema/citation/author#","citation":"https://dataverse.org/schema/citation/","datasetContact":"https://dataverse.org/schema/citation/datasetContact#","dcterms":"http://purl.org/dc/terms/","dsDescription":"https://dataverse.org/schema/citation/dsDescription#","dvcore":"https://dataverse.org/schema/core#","keyword":"https://dataverse.org/schema/citation/keyword#","ore":"http://www.openarchives.org/ore/terms/","schema":"http://schema.org/"}}