{"id":5951,"identifier":"FK2/XWCBMV","persistentUrl":"https://doi.org/10.34820/FK2/XWCBMV","protocol":"doi","authority":"10.34820","publisher":"Telkom University Dataverse","publicationDate":"2023-10-05","storageIdentifier":"file://10.34820/FK2/XWCBMV","datasetVersion":{"id":370,"datasetId":5951,"datasetPersistentId":"doi:10.34820/FK2/XWCBMV","storageIdentifier":"file://10.34820/FK2/XWCBMV","versionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","lastUpdateTime":"2023-10-05T04:32:32Z","releaseTime":"2023-10-05T04:32:32Z","createTime":"2022-04-12T09:07:51Z","license":"CC0","termsOfUse":"CC0 Waiver","fileAccessRequest":false,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step  Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable  Maximum Completion Time"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"DARU KUSUMA, PURBA"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"fakultas teknik elektro - rekayasa komputer"}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"DARU KUSUMA, PURBA"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"fakultas teknik elektro - rekayasa komputer"},"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"purbodaru@telkomuniversity.ac.id"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step \nEvolutionary Algorithm to Minimize Intermediate Storage with Tolerable \nMaximum Completion Time"},"dsDescriptionDate":{"typeName":"dsDescriptionDate","multiple":false,"typeClass":"primitive","value":"2022-04-12"}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Engineering"]},{"typeName":"keyword","multiple":true,"typeClass":"compound","value":[{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"scheduling"}}]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationURL":{"typeName":"publicationURL","multiple":false,"typeClass":"primitive","value":"https://inass.org/wp-content/uploads/2021/10/2021123141.pdf"}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"DARU KUSUMA, PURBA"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2022-04-12"}]}},"files":[{"label":"ijies_published_parallelflowshop.pdf","restricted":false,"version":1,"datasetVersionId":370,"dataFile":{"id":5952,"persistentId":"doi:10.34820/FK2/XWCBMV/M8WHL7","pidURL":"https://doi.org/10.34820/FK2/XWCBMV/M8WHL7","filename":"ijies_published_parallelflowshop.pdf","contentType":"application/pdf","filesize":436842,"storageIdentifier":"file://1801d06d4af-1871b124e915","rootDataFileId":-1,"md5":"09f1d1d15bf9fac5b4d0e9c6d810aad0","checksum":{"type":"MD5","value":"09f1d1d15bf9fac5b4d0e9c6d810aad0"},"creationDate":"2022-04-12"}}],"citation":"DARU KUSUMA, PURBA, 2023, \"A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time\", https://doi.org/10.34820/FK2/XWCBMV, Telkom University Dataverse, V1"}}