Research Journal of Applied Sciences
ISSN: Online 1993-6079ISSN: Print 1815-932x
Abstract
Permutation flow shop scheduling problems present an important class of sequencing problems in the realm of production planning. The study briefly reviews typical categories of the PFSSPs in accordance with a defined classification scheme of the particular problems. Subsequently, a review of frequent approaches and methods for PFSSP solving is treated. A final section of the study summarizes findings of this review that is mapping the field over field over the last 25 years.
How to cite this article:
Ivan Lazar. Approaches to Solving of Permutation Flow Shop Scheduling Problem: An Exploration Study.
DOI: https://doi.org/10.36478/rjasci.2012.426.434
URL: https://www.makhillpublications.co/view-article/1815-932x/rjasci.2012.426.434