A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling

This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values in...

Full description

Saved in:

Bibliographic Details
Published in:	Applied sciences Vol. 11; no. 11; p. 4837
Main Authors:	Abdel-Basset, Mohamed, Mohamed, Reda, Abouhawwash, Mohamed, Chang, Victor, Askar, S.
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.06.2021
Subjects:	generalized normal distribution optimization algorithm Genetic algorithms Heuristic Linear programming local search strategy makespan Mutation Normal distribution Optimization algorithms permutation flow shop scheduling
ISSN:	2076-3417, 2076-3417
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values into discrete ones to make GNDO applicable for solving this discrete problem. Additionally, the discrete GNDO is effectively integrated with a local search strategy to improve the quality of the best-so-far solution in an abbreviated version of HGNDO. More than that, a new improvement using the swap mutation operator applied on the best-so-far solution to avoid being stuck into local optima by accelerating the convergence speed is effectively applied to HGNDO to propose a new version, namely a hybrid-improved GNDO (HIGNDO). Last but not least, the local search strategy is improved using the scramble mutation operator to utilize each trial as ideally as possible for reaching better outcomes. This improved local search strategy is integrated with IGNDO to produce a new strong algorithm abbreviated as IHGNDO. Those proposed algorithms are extensively compared with a number of well-established optimization algorithms using various statistical analyses to estimate the optimal makespan for 41 well-known instances in a reasonable time. The findings show the benefits and speedup of both IHGNDO and HIGNDO over all the compared algorithms, in addition to HGNDO.
AbstractList	This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values into discrete ones to make GNDO applicable for solving this discrete problem. Additionally, the discrete GNDO is effectively integrated with a local search strategy to improve the quality of the best-so-far solution in an abbreviated version of HGNDO. More than that, a new improvement using the swap mutation operator applied on the best-so-far solution to avoid being stuck into local optima by accelerating the convergence speed is effectively applied to HGNDO to propose a new version, namely a hybrid-improved GNDO (HIGNDO). Last but not least, the local search strategy is improved using the scramble mutation operator to utilize each trial as ideally as possible for reaching better outcomes. This improved local search strategy is integrated with IGNDO to produce a new strong algorithm abbreviated as IHGNDO. Those proposed algorithms are extensively compared with a number of well-established optimization algorithms using various statistical analyses to estimate the optimal makespan for 41 well-known instances in a reasonable time. The findings show the benefits and speedup of both IHGNDO and HIGNDO over all the compared algorithms, in addition to HGNDO.
Author	Mohamed, Reda Abouhawwash, Mohamed Askar, S. Chang, Victor Abdel-Basset, Mohamed
Author_xml	– sequence: 1 givenname: Mohamed surname: Abdel-Basset fullname: Abdel-Basset, Mohamed – sequence: 2 givenname: Reda surname: Mohamed fullname: Mohamed, Reda – sequence: 3 givenname: Mohamed orcidid: 0000-0003-2846-4707 surname: Abouhawwash fullname: Abouhawwash, Mohamed – sequence: 4 givenname: Victor orcidid: 0000-0002-8012-5852 surname: Chang fullname: Chang, Victor – sequence: 5 givenname: S. orcidid: 0000-0002-1167-2430 surname: Askar fullname: Askar, S.
BookMark	eNptUU1PwzAMjRBIjI8Tf6ASR1RImjRtjmMwQJoAaXCO3NTdMnVNSVsh-PWEDaEJ4Ystv-f3LPuI7DeuQULOGL3kXNEraFsWQuQ82yOjhGYy5oJl-zv1ITntuhUNoRjPGR0RM45mzkAdzRG8WcbX0GEZ3WGDHmr7GepH59cBv7Fd720x9NY10bheOG_75TqqnI-e0a-HHjbItHbv0Xzp2mhullgOtW0WJ-SggrrD0598TF6nty-T-3j2dPcwGc9iw6XoY1FVaYEohVEml1ihVGhylhZ5VaIsMpQcKRoqoUxSwZTKuCwxFwiiQpoafkwetrqlg5VuvV2D_9AOrN40nF9o8L01NWrMyzQTLBhzIxIlFEABqZGKpiJ4yqB1vtVqvXsbsOv1yg2-CevrRPJU0DwcMLAutizjXdd5rH5dGdXfT9E7Twls9odt7PZsvQdb_zvzBRNSkZU
CitedBy_id	crossref_primary_10_3390_a15080277 crossref_primary_10_3390_en16083532 crossref_primary_10_3390_en16031311 crossref_primary_10_1002_ima_70175 crossref_primary_10_3390_a16010029 crossref_primary_10_3390_s22041410 crossref_primary_10_3390_math10214048 crossref_primary_10_3390_computers11040053
Cites_doi	10.1080/00207543.2013.767988 10.1088/1742-6596/1671/1/012008 10.1109/TSMCB.2006.883272 10.1016/j.enconman.2020.113301 10.1109/ICRAIE51050.2020.9358351 10.1109/TSP.2019.2896246 10.1016/j.future.2018.03.020 10.1016/j.knosys.2015.12.022 10.3390/rs11121421 10.1109/TVT.2020.2995146 10.1016/0305-0483(83)90088-9 10.1016/j.advengsoft.2017.07.002 10.1016/j.eswa.2020.113176 10.1287/opre.8.2.178 10.1109/ACCESS.2020.3000770 10.3906/elk-1404-220 10.3390/e18030084 10.3390/e20090714 10.1007/s10489-020-01722-3 10.1016/j.engappai.2008.07.007 10.1016/j.advengsoft.2014.07.006 10.1016/j.ijpe.2010.08.004 10.1504/EJIE.2011.042737 10.3390/math9030270 10.1016/j.knosys.2019.105190 10.1016/j.engappai.2020.103541 10.3390/a6020227 10.1016/j.swevo.2019.100575 10.1016/j.ins.2019.10.026 10.1016/j.advengsoft.2012.09.003 10.1016/0305-0548(93)E0014-K 10.1057/palgrave.jors.2602455 10.1142/S0219691319500504 10.1016/j.renene.2012.04.052 10.2991/ijcis.d.210112.002 10.1051/ro/1978120403331 10.1016/j.asoc.2011.10.024 10.1109/TEVC.2018.2885075
ContentType	Journal Article
Copyright	2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS DOA
DOI	10.3390/app11114837
DatabaseName	CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One ProQuest Central Korea ProQuest One Academic ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New)
DatabaseTitleList	CrossRef Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Sciences (General)
EISSN	2076-3417
ExternalDocumentID	oai_doaj_org_article_e8d5741c363c42949aaba5c69054c816 10_3390_app11114837
GroupedDBID	.4S 2XV 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO IGS ITC K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c364t-4ff5bee64c9c86efe69ec815b8fde6b7e63e0ec06ad254199736de84ea4fe05c3
IEDL.DBID	DOA
ISICitedReferencesCount	12
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000659568400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2076-3417
IngestDate	Mon Nov 10 04:31:41 EST 2025 Sun Nov 09 08:41:28 EST 2025 Tue Nov 18 22:20:28 EST 2025 Sat Nov 29 07:13:57 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c364t-4ff5bee64c9c86efe69ec815b8fde6b7e63e0ec06ad254199736de84ea4fe05c3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-1167-2430 0000-0003-2846-4707 0000-0002-8012-5852
OpenAccessLink	https://doaj.org/article/e8d5741c363c42949aaba5c69054c816
PQID	2635408138
PQPubID	2032433
ParticipantIDs	doaj_primary_oai_doaj_org_article_e8d5741c363c42949aaba5c69054c816 proquest_journals_2635408138 crossref_primary_10_3390_app11114837 crossref_citationtrail_10_3390_app11114837
PublicationCentury	2000
PublicationDate	2021-06-01
PublicationDateYYYYMMDD	2021-06-01
PublicationDate_xml	– month: 06 year: 2021 text: 2021-06-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Applied sciences
PublicationYear	2021
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Li (ref_36) 2021; 14 Yang (ref_16) 2019; 17 Chen (ref_25) 2013; 6 Wang (ref_29) 2009; 22 Moslehi (ref_27) 2011; 129 Gokalp (ref_6) 2020; 146 Wan (ref_28) 2012; 48 ref_11 Heller (ref_41) 1960; 8 Dobre (ref_10) 2020; 69 Berry (ref_14) 1980; 370 Sayadi (ref_1) 2010; 1 Faramarzi (ref_45) 2020; 191 ref_19 Javidi (ref_26) 2016; 24 Li (ref_3) 2020; 50 ref_17 Zhang (ref_38) 2020; 224 Manogaran (ref_34) 2018; 85 ref_15 Mirjalili (ref_44) 2017; 114 Liu (ref_22) 2007; 37 Tseng (ref_7) 2008; 59 Sharma (ref_13) 2020; 23 Mallat (ref_20) 1989; Volume 11 Cao (ref_23) 2018; 23 Li (ref_33) 2013; 55 Kaur (ref_46) 2020; 90 ref_24 Mirjalili (ref_43) 2016; 96 Xiong (ref_12) 2020; 22 Diab (ref_4) 2020; 8 ref_21 ref_42 Reeves (ref_40) 1995; 22 Ali (ref_2) 2020; 512 Liu (ref_31) 2013; 13 He (ref_37) 2019; 51 Nawaz (ref_9) 1983; 11 Zheng (ref_18) 2019; 67 Xie (ref_32) 2014; 77 Mishra (ref_35) 2020; 11 Carlier (ref_39) 1978; 12 ref_5 Madhushini (ref_8) 2011; 5 Li (ref_30) 2013; 51
References_xml	– volume: 23 start-page: 211 year: 2020 ident: ref_13 article-title: HIGA: Harmony-inspired genetic algorithm for rack-aware energy-efficient task scheduling in cloud data centers publication-title: Eng. Sci. Technol. Int. J. – volume: 51 start-page: 4732 year: 2013 ident: ref_30 article-title: A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.767988 – ident: ref_11 doi: 10.1088/1742-6596/1671/1/012008 – volume: 37 start-page: 18 year: 2007 ident: ref_22 article-title: An effective PSO-based memetic algorithm for flow shop scheduling publication-title: IEEE Trans. Syst. Man Cybern. Part B (Cybern.) doi: 10.1109/TSMCB.2006.883272 – volume: 224 start-page: 113301 year: 2020 ident: ref_38 article-title: Generalized normal distribution optimization and its applications in parameter extraction of photovoltaic models publication-title: Energy Convers. Manag. doi: 10.1016/j.enconman.2020.113301 – ident: ref_24 – volume: Volume 11 start-page: 674 year: 1989 ident: ref_20 article-title: A theory for multiresolution signal decomposition: The wavelet representation publication-title: Fundamental Papers in Wavelet Theory – ident: ref_5 doi: 10.1109/ICRAIE51050.2020.9358351 – volume: 67 start-page: 1696 year: 2019 ident: ref_18 article-title: A framework of adaptive multiscale wavelet decomposition for signals on undirected graphs publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2019.2896246 – volume: 11 start-page: 415 year: 2020 ident: ref_35 article-title: A discrete Jaya algorithm for permutation flow-shop scheduling problem publication-title: Int. J. Ind. Eng. Comput. – volume: 85 start-page: 129 year: 2018 ident: ref_34 article-title: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem publication-title: Future Gener. Comput. Syst. doi: 10.1016/j.future.2018.03.020 – volume: 96 start-page: 120 year: 2016 ident: ref_43 article-title: SCA: A sine cosine algorithm for solving optimization problems publication-title: Knowl. Based Syst. doi: 10.1016/j.knosys.2015.12.022 – ident: ref_21 doi: 10.3390/rs11121421 – volume: 69 start-page: 8805 year: 2020 ident: ref_10 article-title: Task scheduling for mobile edge computing using genetic algorithm and conflict graphs publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2020.2995146 – volume: 11 start-page: 91 year: 1983 ident: ref_9 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega doi: 10.1016/0305-0483(83)90088-9 – volume: 114 start-page: 163 year: 2017 ident: ref_44 article-title: Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2017.07.002 – volume: 146 start-page: 113176 year: 2020 ident: ref_6 article-title: A novel wrapper feature selection algorithm based on iterated greedy metaheuristic for sentiment classification publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2020.113176 – volume: 8 start-page: 178 year: 1960 ident: ref_41 article-title: Some numerical experiments for an M× J flow shop and its decision-theoretical aspects publication-title: Oper. Res. doi: 10.1287/opre.8.2.178 – volume: 8 start-page: 111102 year: 2020 ident: ref_4 article-title: Coyote optimization algorithm for parameters estimation of various models of solar cells and PV modules publication-title: IEEE Access doi: 10.1109/ACCESS.2020.3000770 – volume: 370 start-page: 459 year: 1980 ident: ref_14 article-title: On the Weierstrass-Mandelbrot fractal function publication-title: Math. Phys. Sci. – volume: 24 start-page: 3852 year: 2016 ident: ref_26 article-title: A hybrid search method of wrapper feature selection by chaos particle swarm optimization and local search publication-title: Turk. J. Electr. Eng. Comput. Sci. doi: 10.3906/elk-1404-220 – ident: ref_15 doi: 10.3390/e18030084 – ident: ref_17 doi: 10.3390/e20090714 – volume: 50 start-page: 3350 year: 2020 ident: ref_3 article-title: A novel discrete whale optimization algorithm for solving knapsack problems publication-title: Appl. Intell. doi: 10.1007/s10489-020-01722-3 – volume: 22 start-page: 298 year: 2009 ident: ref_29 article-title: Reserve-constrained multiarea environmental/economic dispatch based on particle swarm optimization with local search publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2008.07.007 – volume: 77 start-page: 35 year: 2014 ident: ref_32 article-title: An effective hybrid teaching–learning-based optimization algorithm for permutation flow shop scheduling problem publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2014.07.006 – volume: 129 start-page: 14 year: 2011 ident: ref_27 article-title: A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2010.08.004 – volume: 5 start-page: 361 year: 2011 ident: ref_8 article-title: Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives publication-title: Eur. J. Ind. Eng. doi: 10.1504/EJIE.2011.042737 – ident: ref_42 doi: 10.3390/math9030270 – volume: 191 start-page: 105190 year: 2020 ident: ref_45 article-title: Equilibrium optimizer: A novel optimization algorithm publication-title: Knowl. Based Syst. doi: 10.1016/j.knosys.2019.105190 – volume: 90 start-page: 103541 year: 2020 ident: ref_46 article-title: Tunicate swarm algorithm: A new bio-inspired based metaheuristic paradigm for global optimization publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2020.103541 – volume: 6 start-page: 227 year: 2013 ident: ref_25 article-title: Solving university course timetabling problems using constriction particle swarm optimization with local search publication-title: Algorithms doi: 10.3390/a6020227 – volume: 51 start-page: 100575 year: 2019 ident: ref_37 article-title: A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.100575 – volume: 1 start-page: 1 year: 2010 ident: ref_1 article-title: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems publication-title: Int. J. Ind. Eng. Comput. – volume: 512 start-page: 880 year: 2020 ident: ref_2 article-title: An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem publication-title: Inf. Sci. doi: 10.1016/j.ins.2019.10.026 – volume: 55 start-page: 10 year: 2013 ident: ref_33 article-title: An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2012.09.003 – volume: 22 start-page: 5 year: 1995 ident: ref_40 article-title: A genetic algorithm for flowshop sequencing publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(93)E0014-K – volume: 59 start-page: 1373 year: 2008 ident: ref_7 article-title: New MILP models for the permutation flowshop problem publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2602455 – volume: 17 start-page: 1950050 year: 2019 ident: ref_16 article-title: Hyperspectral image classification using wavelet transform-based smooth ordering publication-title: Int. J. Wavelets Multiresolut. Inf. Process. doi: 10.1142/S0219691319500504 – ident: ref_19 – volume: 48 start-page: 276 year: 2012 ident: ref_28 article-title: Wind farm micro-siting by Gaussian particle swarm optimization with local search strategy publication-title: Renew. Energy doi: 10.1016/j.renene.2012.04.052 – volume: 14 start-page: 651 year: 2021 ident: ref_36 article-title: Enhancing Whale Optimization Algorithm with Chaotic Theory for Permutation Flow Shop Scheduling Problem publication-title: Int. J. Comput. Intell. Syst. doi: 10.2991/ijcis.d.210112.002 – volume: 22 start-page: 1 year: 2020 ident: ref_12 article-title: Color disease spot image segmentation algorithm based on chaotic particle swarm optimization and FCM publication-title: J. Supercomput. – volume: 12 start-page: 333 year: 1978 ident: ref_39 article-title: Ordonnancements a contraintes disjonctives publication-title: Rairo-Oper. Res. doi: 10.1051/ro/1978120403331 – volume: 13 start-page: 1459 year: 2013 ident: ref_31 article-title: A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.10.024 – volume: 23 start-page: 718 year: 2018 ident: ref_23 article-title: Comprehensive learning particle swarm optimization algorithm with local search for multimodal functions publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2018.2885075
SSID	ssj0000913810
Score	2.2608855
Snippet	This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because...
SourceID	doaj proquest crossref
SourceType	Open Website Aggregation Database Enrichment Source Index Database
StartPage	4837
SubjectTerms	generalized normal distribution optimization algorithm Genetic algorithms Heuristic Linear programming local search strategy makespan Mutation Normal distribution Optimization algorithms permutation flow shop scheduling
SummonAdditionalLinks	– databaseName: Publicly Available Content Database dbid: PIMPY link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3BbhMxEB1BygEOQAsVKQX50AMgrerEXsd7QikQgVSiSAWpnFZee5xWCtmQpEXi65nZdUIRiBO31doHW88zb2yP3wAcKRZlCxKzMPAx03mUZFIuZsbF3PionfaNZP7pYDy25-fFJD2PXqW0yo1PbBx1q_bMedvkhI9D7fnE_JglVDSxmbKvF98yriHFd62poMZt2OEn3rYDO5MPHydftmcurIFpe7J9pqdot8-3xOwzWFb9N2Jq9Pv_cM8N54we_N_RPoT7KfYUw3ax7MItnO_BvRuKhHuwm2x9JV4kQeqXj8APxSlTnmhzk7MTYr4gUvvlD_oec-Q7E29ZhTcV0BLD2ZTGsL74KiguFhNigKv22l-MZvV3cXZRL8QZLZnAufDTx_B59O7Tm_dZKs6QeWX0OtMx5hWi0b7w1mBEU6C3vbyyMaCpBmgUSvTSuEBgcDqLMgGtRqcjytyrfejM6zk-AdEfSB2i6aE0fa2UsyxiZlVAGTGv-rELrzbIlD4pl3MBjVlJOxiGsbwBYxeOtp0XrWDH37udMMTbLqyy3fyol9MyGW2JNuQUcdGElSfe1oVzlcu9KSjOpbmaLhxu0C-T6a_KX2Af_Lv5Kdztc4JMc6RzCJ318gqfwR1_vb5cLZ-ntfsT9cQBCw priority: 102 providerName: ProQuest
Title	A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling
URI	https://www.proquest.com/docview/2635408138 https://doaj.org/article/e8d5741c363c42949aaba5c69054c816
Volume	11
WOSCitedRecordID	wos000659568400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ1LTxsxEIAtBBzaQwW0VVMe8oFDW2lVJ36s95gAUZEgWpVWoqeV1x5DpJCgJIDEr2dm16BUrdRLb_uwtKvxeB7r2W8YO5QEZQsCspD7mCkdBS4pFzPjojY-Kqd8g8w_y0cje3lZlCutvqgmrMUDt4L7CjZo9HpeGunRdqrCudppj0mdVt52G9i2yIuVZKqxwUWX0FXtD3kS83raDybrQAD131xQQ-r_wxA33mW4xd6ksJD329fZZmsw3WGvV2CBO2w7LcMF_5RY0Z_fMt_nZ-SNeFs2nA3QKQWe7o8f8XhEQemEHxMgN_W24v3J1Ww-Xl7fcAxZeYnG-a7dkefDyeyBX1zPbvkFzmagMvWrd-zn8OTH0bcs9U3IUEpqmakYdQ1glC-8NRDBFICi0rWNAUydg5EgwAvjAqaHVGkiTQCrwKkIQnv5nq1PZ1P4wHgvFypE0wVhekpKZ4kvZmUAEUHXvdhhX55FWfkEFafeFpMKkwuSe7Ui9w47fBl827I0_j5sQHPyMoQA2M0FVIsqqUX1L7XosL3nGa3SqlxUBN5RGANJ-_F_PGOXvepRhUvzTWaPrS_nd7DPNv39cryYH7CNwcmo_H7QKCaelafn5a8n_RXorQ
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Rb9MwED6NDQl4ADZAFAb4YUiAFOHGjus8INSyVZtWqooNaW8hsc_dpNKUtmOCH8VvxJc4ZQjE2x54i2Ir0sWf7zvb5-8AdgSJslmOke0YF8nEcT-lchep3CXKOJlLU0nmDzrDoT45SUdr8KO5C0NplY1PrBy1LQ3tkb8m0RTp-Uvot7MvEVWNotPVpoRGDYtD_Hbhl2yLNwe7fnyfx3F_7_jdfhSqCkRGKLmMpHNJgaikSY1W6FClaHQ7KbSzqIoOKoEcDVe59YsnysMQyqKWmEuHPDHCf_cabEghlZ9XG7294ejDaleHVDZ1m9cXAYVIOZ1Dk1ci4fbfqK-qEPAHAVSs1r_zv_2Pu3A7xM-sWwN-E9ZwugW3LqkqbsFm8FcL9iKIar-8B6bLBkTbrM6vjnqevS0L7Wff_fOQovcJ2yUl4VAEjHUnY2_z8vQz87E9G3kWO69TF1h_Ul6wo9Nyxo487C3l84_vw8crMf0BrE_LKT4EFne4tE61katYCpFrEmLTwiJ3mBSxa8GrZuwzE9TXqQjIJPOrMAJKdgkoLdhZdZ7VoiN_79YjEK26kFJ49aKcj7PgeDLUNvFRozdYGB97yDTPizwxKvWxurdVtWC7wVcW3Nci-wWuR_9ufgY39o_fD7LBwfDwMdyMKeGn2qLahvXl_ByfwHXzdXm2mD8NM4XBp6sG40-URlXZ
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Pb9MwFH4aHUJwADZAKwzwYUiAFM2NHTc5INTSVUyrooqBtFtI7OduUteUtmOCP42_Dr_EKUMgbjtwixIr0ku-98P25-8B7AkSZTMcA9PVNpCR5c6lchuo3EZKW5lLXUnmj7ppGp-cJOMN-NGchSFaZRMTq0BtSk1r5PskmiJd_hLxvvW0iPFg-Hb-JaAOUrTT2rTTqCFyhN8u3fRt-eZw4P71izAcHnx89z7wHQYCLZRcBdLaqEBUUic6VmhRJajjTlTE1qAquqgEctRc5cZNpIiTIZTBWGIuLfJIC_feG7DZJZX1Fmz2D9Lxh_UKDyluxh1eHwoUIuG0J00RikTcf0uDVbeAP5JBleGG9_7nb3Mf7vq6mvVqR9iCDZxtw50raovbsOXj2JK99GLbrx6A7rERpXNW866DvsvqhvnnZ9_ddUpV_ZQNSGHYNwdjvenE2bw6PWeu5mdjl90uakoDG07LS3Z8Ws7ZsXMHQzz_yUP4dC2mP4LWrJzhDrCwy6WxqoNchVKIPCaBtlgY5BajIrRteN3gINNelZ2ag0wzNzsj0GRXQNOGvfXgeS1G8vdhfQLUeggpiFc3ysUk8wEpw9hErpp0BgvtahKZ5HmRR1olroZ3tqo27DZYy3xYW2a_gPb434-fwy2HwGx0mB49gdsh8YCqlatdaK0WF_gUbuqvq7Pl4pl3GgafrxuLPwGbJV6c
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Local+Search-Based+Generalized+Normal+Distribution+Algorithm+for+Permutation+Flow+Shop+Scheduling&rft.jtitle=Applied+sciences&rft.au=Abdel-Basset%2C+Mohamed&rft.au=Mohamed%2C+Reda&rft.au=Abouhawwash%2C+Mohamed&rft.au=Chang%2C+Victor&rft.date=2021-06-01&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=11&rft.issue=11&rft.spage=4837&rft_id=info:doi/10.3390%2Fapp11114837&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app11114837
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon