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/XWCBMV)

View:

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/XWCBMV
Distributor:	Telkom University Dataverse
Date of Distribution:	2023-10-05
Version:	1
Bibliographic 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
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/XWCBMV
Authoring Entity:	DARU KUSUMA, PURBA (fakultas teknik elektro - rekayasa komputer)
Distributor:	Telkom University Dataverse
Access Authority:	DARU KUSUMA, PURBA
Depositor:	DARU KUSUMA, PURBA
Date of Deposit:	2022-04-12
Study Scope
Keywords:	Engineering, scheduling
Abstract:	A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time
Methodology and Processing
Sources Statement
Data Access
Notes:	CC0 Waiver
Other Study Description Materials
Other Study-Related Materials
Label:	ijies_published_parallelflowshop.pdf
Notes:	application/pdf