A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time (doi:10.34820/FK2/DC4WZP)

View:

Part 1: Document Description
Part 2: Study Description
Part 5: Other Study-Related Materials
Entire Codebook

Document Description

Citation

Title:

A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time

Identification Number:

doi:10.34820/FK2/DC4WZP

Distributor:

Telkom University Dataverse

Date of Distribution:

2022-07-14

Version:

1

Bibliographic Citation:

Purba Daru Kusuma; Abduh Sayid Albana, 2022, "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/DC4WZP, Telkom University Dataverse, V1

Study Description

Citation

Title:

A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time

Identification Number:

doi:10.34820/FK2/DC4WZP

Authoring Entity:

Purba Daru Kusuma (Telkom University)

Abduh Sayid Albana (Institut Teknologi Telkom Surabaya)

Distributor:

Telkom University Dataverse

Access Authority:

DARU KUSUMA, PURBA

Depositor:

DARU KUSUMA, PURBA

Date of Deposit:

2022-07-14

Study Scope

Keywords:

Computer and Information Science

Abstract:

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).

Methodology and Processing

Sources Statement

Data Access

Notes:

CC0 Waiver

Other Study Description Materials

Related Publications

Citation

Identification Number:

10.22266/ijies2021.1231.41

Bibliographic Citation:

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.

Other Study-Related Materials

Label:

ijies_published_parallelflowshop.pdf

Notes:

application/pdf