<?xml version='1.0' encoding='UTF-8'?><metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns="http://dublincore.org/documents/dcmi-terms/"><dcterms:title>Dataset for parallel flow-shop scheduling</dcterms:title><dcterms:identifier>https://doi.org/10.34820/FK2/0S67CT</dcterms:identifier><dcterms:creator>DARU KUSUMA, PURBA</dcterms:creator><dcterms:publisher>Telkom University Dataverse</dcterms:publisher><dcterms:issued>2022-09-29</dcterms:issued><dcterms:modified>2022-09-29T02:19:33Z</dcterms:modified><dcterms:description>This data consists of 40 jobs. Each job will be processed in four stages. The average processing time of each stage is 5 unit time and follows normal distribution. Each data consists of five attributes: job id, stage 1 processing time, stage 2 processing time, stage 3 processing time, and stage 4 processing time. This data is simulation generated data. There are 30 trials. This data contains 1,200 rows.</dcterms:description><dcterms:subject>Engineering</dcterms:subject><dcterms:subject>optimization, operations research, flow-shop</dcterms:subject><dcterms:isReferencedBy>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), 2021.</dcterms:isReferencedBy><dcterms:contributor>DARU KUSUMA, PURBA</dcterms:contributor><dcterms:dateSubmitted>2022-09-29</dcterms:dateSubmitted><dcterms:license>CC0</dcterms:license><dcterms:rights>CC0 Waiver</dcterms:rights></metadata>