Cost Optimal Production-Scheduling Model Based on VNS-NSGA-II Hybrid Algorithm—Study on Tissue Paper Mill

With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for fast-moving consumer goods. However, this production mode has two issues: high production cost and the long manufacturing period. To address these...

Full description

Saved in:
Bibliographic Details
Published inProcesses Vol. 10; no. 10; p. 2072
Main Authors Zhang, Huanhuan, Li, Jigeng, Hong, Mengna, Man, Yi, He, Zhenglei
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.10.2022
Subjects
Online AccessGet full text
ISSN2227-9717
2227-9717
DOI10.3390/pr10102072

Cover

Abstract With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for fast-moving consumer goods. However, this production mode has two issues: high production cost and the long manufacturing period. To address these issues, this study proposes a multi-objective optimization model for the flexible flow-shop to optimize the production scheduling, which would maximize the production efficiency by minimizing the production cost and makespan. The model is designed based on hybrid algorithms, which combine a fast non-dominated genetic algorithm (NSGA-II) and a variable neighborhood search algorithm (VNS). In this model, NSGA-II is the major algorithm to calculate the optimal solutions. VNS is to improve the quality of the solution obtained by NSGA-II. The model is verified by an example of a real-world typical FFS, a tissue papermaking mill. The results show that the scheduling model can reduce production costs by 4.2% and makespan by 6.8% compared with manual scheduling. The hybrid VNS-NSGA-II model also shows better performance than NSGA-II, both in production cost and makespan. Hybrid algorithms are a good solution for multi-objective optimization issues in flexible flow-shop production scheduling.
AbstractList With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for fast-moving consumer goods. However, this production mode has two issues: high production cost and the long manufacturing period. To address these issues, this study proposes a multi-objective optimization model for the flexible flow-shop to optimize the production scheduling, which would maximize the production efficiency by minimizing the production cost and makespan. The model is designed based on hybrid algorithms, which combine a fast non-dominated genetic algorithm (NSGA-II) and a variable neighborhood search algorithm (VNS). In this model, NSGA-II is the major algorithm to calculate the optimal solutions. VNS is to improve the quality of the solution obtained by NSGA-II. The model is verified by an example of a real-world typical FFS, a tissue papermaking mill. The results show that the scheduling model can reduce production costs by 4.2% and makespan by 6.8% compared with manual scheduling. The hybrid VNS-NSGA-II model also shows better performance than NSGA-II, both in production cost and makespan. Hybrid algorithms are a good solution for multi-objective optimization issues in flexible flow-shop production scheduling.
Audience Academic
Author He, Zhenglei
Hong, Mengna
Man, Yi
Zhang, Huanhuan
Li, Jigeng
Author_xml – sequence: 1
  givenname: Huanhuan
  orcidid: 0000-0001-7788-7795
  surname: Zhang
  fullname: Zhang, Huanhuan
– sequence: 2
  givenname: Jigeng
  surname: Li
  fullname: Li, Jigeng
– sequence: 3
  givenname: Mengna
  surname: Hong
  fullname: Hong, Mengna
– sequence: 4
  givenname: Yi
  orcidid: 0000-0002-3745-9128
  surname: Man
  fullname: Man, Yi
– sequence: 5
  givenname: Zhenglei
  orcidid: 0000-0003-4751-7819
  surname: He
  fullname: He, Zhenglei
BookMark eNp9kctKAzEUhoMoeN34BAF3ytTcpjNZ1qK1UC9QdTukSaZG08mYZJDufAif0CcxpYIiYs4i4eT7w3_-7ILNxjUagEOMepRydNp6jDAiqCAbYIcQUmS8wMXmj_M2OAjhCaXFMS3z_g54HroQ4U0bzUJYeOud6mQ0rsmm8lGrzppmDq-c0haeiaAVdA18uJ5m19PRIBuP4eVy5o2CAzt33sTHxcfb-zR2arni7kwInYa3otUeXhlr98FWLWzQB1_7Hri_OL8bXmaTm9F4OJhkklIWMyp1qTAvKWGIMkmYqqkq80IXiOs-SbdU0lkaVVFEmO4zIrHgWMpZrfOa1nQPnKzf7ZpWLF-FtVXr03x-WWFUraKqvqNK9NGabr176XSI1ZPrfJMMVqQgZU4YoSuqt6bmwurKNLWLXshUSi-MTP9Qm9QfFIxxTniZJwFaC6R3IXhdV9JEsYo2CY3928nxL8k_tj8BFzyXDQ
CitedBy_id crossref_primary_10_1007_s43621_024_00259_6
crossref_primary_10_1016_j_ces_2025_121297
crossref_primary_10_1016_j_cirpj_2023_08_003
crossref_primary_10_1016_j_jclepro_2023_139039
crossref_primary_10_1016_j_eswa_2024_123473
Cites_doi 10.1016/j.jpdc.2018.07.022
10.1016/j.jclepro.2018.10.048
10.1080/00207540802124301
10.1016/j.ijpe.2010.08.004
10.1109/TEVC.2015.2429314
10.1109/4235.996017
10.1016/j.asoc.2018.10.027
10.1016/j.rcim.2019.04.006
10.1007/s10951-010-0205-x
10.1016/j.ifacol.2020.12.631
10.1109/4235.797969
10.1016/j.jclepro.2018.11.021
10.1016/j.jclepro.2017.01.011
10.1016/j.cie.2018.07.049
10.1016/j.ijpe.2013.01.028
10.1016/j.ejor.2007.02.002
10.1021/acs.iecr.1c00209
10.1016/j.cie.2019.03.022
10.3390/pr7070438
10.1016/j.jclepro.2018.02.224
10.1016/j.ejor.2017.11.070
10.1016/j.eswa.2018.11.007
10.1007/s00170-015-7657-2
10.1016/j.cor.2016.12.024
ContentType Journal Article
Copyright COPYRIGHT 2022 MDPI AG
2022 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: COPYRIGHT 2022 MDPI AG
– notice: 2022 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
7SR
8FD
8FE
8FG
8FH
ABJCF
ABUWG
AFKRA
AZQEC
BBNVY
BENPR
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
GNUQQ
HCIFZ
JG9
KB.
LK8
M7P
PDBOC
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
ADTOC
UNPAY
DOI 10.3390/pr10102072
DatabaseName CrossRef
Engineered Materials Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Journals
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Technology Collection
ProQuest Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
Materials Research Database
Materials Science Database
Biological Sciences
Biological Science Database
Materials Science Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
Publicly Available Content Database
Materials Research Database
ProQuest Central Student
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
Materials Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Natural Science Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
Engineered Materials Abstracts
Natural Science Collection
ProQuest Central Korea
Biological Science Collection
Materials Science Database
ProQuest Central (New)
ProQuest Materials Science Collection
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
Biological Science Database
ProQuest SciTech Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database

CrossRef
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 2
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 2227-9717
ExternalDocumentID 10.3390/pr10102072
A744992985
10_3390_pr10102072
GroupedDBID 5VS
8FE
8FG
8FH
AADQD
AAFWJ
AAYXX
ABJCF
ACIWK
ACPRK
ADBBV
ADMLS
AFKRA
AFZYC
ALMA_UNASSIGNED_HOLDINGS
BBNVY
BCNDV
BENPR
BGLVJ
BHPHI
CCPQU
CITATION
D1I
HCIFZ
IAO
IGS
ITC
KB.
KQ8
LK8
M7P
MODMG
M~E
OK1
PDBOC
PHGZM
PHGZT
PIMPY
PQGLB
PROAC
RNS
7SR
8FD
ABUWG
AZQEC
DWQXO
GNUQQ
JG9
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ADTOC
IPNFZ
RIG
UNPAY
ID FETCH-LOGICAL-c334t-3ce8d198324034c24df3d857e709e62ce83c3b101d3024e642c1a91ccbfe5f3f3
IEDL.DBID UNPAY
ISSN 2227-9717
IngestDate Sun Oct 26 04:14:16 EDT 2025
Fri Jul 25 12:06:59 EDT 2025
Mon Oct 20 16:55:57 EDT 2025
Thu Oct 16 04:26:01 EDT 2025
Thu Apr 24 22:55:01 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
License cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c334t-3ce8d198324034c24df3d857e709e62ce83c3b101d3024e642c1a91ccbfe5f3f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7788-7795
0000-0002-3745-9128
0000-0003-4751-7819
OpenAccessLink https://proxy.k.utb.cz/login?url=https://www.mdpi.com/2227-9717/10/10/2072/pdf?version=1666762095
PQID 2728524232
PQPubID 2032344
ParticipantIDs unpaywall_primary_10_3390_pr10102072
proquest_journals_2728524232
gale_infotracacademiconefile_A744992985
crossref_citationtrail_10_3390_pr10102072
crossref_primary_10_3390_pr10102072
PublicationCentury 2000
PublicationDate 2022-10-01
PublicationDateYYYYMMDD 2022-10-01
PublicationDate_xml – month: 10
  year: 2022
  text: 2022-10-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Processes
PublicationYear 2022
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Branke (ref_8) 2016; 20
Meng (ref_11) 2019; 210
Lu (ref_17) 2017; 144
Vaccari (ref_6) 2020; 53
Mishra (ref_20) 2018; 124
McConky (ref_13) 2019; 208
Zeng (ref_10) 2018; 183
Tran (ref_14) 2011; 14
Fan (ref_24) 2019; 74
Li (ref_4) 2016; 84
Schaller (ref_19) 2019; 119
Luo (ref_5) 2013; 146
Vaccari (ref_7) 2021; 60
Allahverdi (ref_16) 2018; 269
Zitzler (ref_23) 1999; 3
Moslehi (ref_15) 2011; 129
Rosa (ref_25) 2017; 81
Zhu (ref_1) 2019; 130
Luo (ref_9) 2019; 133
Geng (ref_2) 2018; 332
ref_3
Dai (ref_12) 2019; 59
Chandra (ref_18) 2009; 47
Deb (ref_21) 2001; 6
Hansen (ref_22) 2008; 3
References_xml – volume: 133
  start-page: 244
  year: 2019
  ident: ref_9
  article-title: GPU based parallel genetic algorithm for solving an energy-efficient dynamic flexible flow shop scheduling problem
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1016/j.jpdc.2018.07.022
– volume: 208
  start-page: 232
  year: 2019
  ident: ref_13
  article-title: Energy cost minimization for unrelated parallel machine scheduling under real-time and demand charge pricing
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2018.10.048
– volume: 47
  start-page: 5591
  year: 2009
  ident: ref_18
  article-title: Permutation flow shop scheduling with earliness and tardiness penalties
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207540802124301
– volume: 129
  start-page: 14
  year: 2011
  ident: ref_15
  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: 20
  start-page: 110
  year: 2016
  ident: ref_8
  article-title: Automated Design of Production Scheduling Heuristics: A Review
  publication-title: IEEE. Trans. Evol. Comput.
  doi: 10.1109/TEVC.2015.2429314
– volume: 6
  start-page: 182
  year: 2001
  ident: ref_21
  article-title: A fast and elitist multi-objective genetic algorithm: NSGA-II
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/4235.996017
– volume: 74
  start-page: 621
  year: 2019
  ident: ref_24
  article-title: MOEA/D with angle-based constrained dominance principle for constrained multi-objective optimization problems
  publication-title: Appl. Soft. Comput. J.
  doi: 10.1016/j.asoc.2018.10.027
– volume: 59
  start-page: 143
  year: 2019
  ident: ref_12
  article-title: Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints
  publication-title: Robot. Comput.-Integr. Manuf.
  doi: 10.1016/j.rcim.2019.04.006
– volume: 332
  start-page: 1
  year: 2018
  ident: ref_2
  article-title: Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
  publication-title: Appl. Math. Comput.
– volume: 14
  start-page: 483
  year: 2011
  ident: ref_14
  article-title: A water-flow algorithm for flexible flow shop scheduling with intermediate buffers
  publication-title: J. Sched.
  doi: 10.1007/s10951-010-0205-x
– volume: 53
  start-page: 11545
  year: 2020
  ident: ref_6
  article-title: Implementation of an Industry 4.0 system to optimally manage chemical plant operation
  publication-title: IFAC-PapersOnLine
  doi: 10.1016/j.ifacol.2020.12.631
– volume: 3
  start-page: 257
  year: 1999
  ident: ref_23
  article-title: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/4235.797969
– volume: 210
  start-page: 710
  year: 2019
  ident: ref_11
  article-title: MILP models for energy-aware flexible job shop scheduling problem
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2018.11.021
– volume: 144
  start-page: 228
  year: 2017
  ident: ref_17
  article-title: Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2017.01.011
– volume: 124
  start-page: 509
  year: 2018
  ident: ref_20
  article-title: A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2018.07.049
– volume: 146
  start-page: 423
  year: 2013
  ident: ref_5
  article-title: Hybrid flow shop scheduling considering machine electricity consumption cost
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2013.01.028
– volume: 3
  start-page: 593
  year: 2008
  ident: ref_22
  article-title: Neighborhood search: Methods and applications
  publication-title: Ann. Oper. Res.
  doi: 10.1016/j.ejor.2007.02.002
– volume: 60
  start-page: 7853
  year: 2021
  ident: ref_7
  article-title: Optimally managing chemical plant operations: An example oriented by Industry 4.0 paradigms
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/acs.iecr.1c00209
– volume: 130
  start-page: 671
  year: 2019
  ident: ref_1
  article-title: A novel approach based on Neo4j for multi-constrained flexible job shop scheduling problem
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2019.03.022
– ident: ref_3
  doi: 10.3390/pr7070438
– volume: 183
  start-page: 925
  year: 2018
  ident: ref_10
  article-title: Multi-object optimization of flexible flow shop scheduling with the batch process—Consideration total electricity consumption and material wastage
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2018.02.224
– volume: 269
  start-page: 590
  year: 2018
  ident: ref_16
  article-title: No-wait flow shop scheduling problem with two criteria; total tardiness and makespan
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2017.11.070
– volume: 119
  start-page: 376
  year: 2019
  ident: ref_19
  article-title: Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed
  publication-title: Expert. Syst. Appl.
  doi: 10.1016/j.eswa.2018.11.007
– volume: 84
  start-page: 213
  year: 2016
  ident: ref_4
  article-title: Unrelated parallel machine scheduling problem with energy and tardiness cost
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-015-7657-2
– volume: 81
  start-page: 203
  year: 2017
  ident: ref_25
  article-title: Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2016.12.024
SSID ssj0000913856
Score 2.2829278
Snippet With the development of the customization concept, small-batch and multi-variety production will become one of the major production modes, especially for...
SourceID unpaywall
proquest
gale
crossref
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
StartPage 2072
SubjectTerms Algorithms
Analysis
Economic aspects
Efficiency
Energy consumption
Genetic algorithms
Manufacturing costs
Multiple objective analysis
Optimization algorithms
Optimization models
Paper industry
Paper mills
Papermaking
Production costs
Production management
Production scheduling
Pulp & paper mills
Scheduling
Search algorithms
Software
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3NbtQwEB6V7QF6QLSAuqUgS1SCHqyuYydxDghtq5YtEmHFtqi3yH8pEmk23U2F9sZD8IQ8CZ5ssi0I9RYpjhPN55nxODPfAOwxoZwIpaIyihIqtPVXwjka54nUCZNaMawd_pRGo3Px8SK8WIO0q4XBtMrOJjaG2k4NnpEfBHEgQ3T-wfvqmmLXKPy72rXQUG1rBfuuoRh7AOsBMmP1YP3wOB1_WZ26IAumDKMlTyn38f5BNWNIqzaIg78807_2eQMe3pSVWvxQRXHHAZ08gcftzpEMl1Bvwport2DjDp_gFmy2mjonb1s66f2n8P1oOq_JZ28arvzj4yXDq0eDTjxeFhPRLwl2RCvIofdolkxL8jWd0HTyYUhPT8logTVdZFhcemnU365-__yFuYcLHHfWoEbGqnIzglWFz-D85PjsaETbFgvUcC5qyo2TliWyoeUTJhA251aGsYsHiYsCf5cbrr2ELPfO3PlgxTCVMGN07sKc5_w59Mpp6baB5JpzhgFOHmlh2UDmwiXShEmknI4178N-J97MtPzj2AajyHwcglBkt1D04fVqbLVk3fjvqDeIUoaq6Gcyqq0o8N-DpFbZMBY-ngsSGfZhtwMya3V0nt2uqD7srcC9530798_yAh4FWBvRZPrtQq-e3biXfsdS61ftMvwDcwzqZg
  priority: 102
  providerName: ProQuest
Title Cost Optimal Production-Scheduling Model Based on VNS-NSGA-II Hybrid Algorithm—Study on Tissue Paper Mill
URI https://www.proquest.com/docview/2728524232
https://www.mdpi.com/2227-9717/10/10/2072/pdf?version=1666762095
UnpaywallVersion publishedVersion
Volume 10
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2227-9717
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000913856
  issn: 2227-9717
  databaseCode: KQ8
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 2227-9717
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913856
  issn: 2227-9717
  databaseCode: ADMLS
  dateStart: 20150601
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2227-9717
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000913856
  issn: 2227-9717
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 2227-9717
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000913856
  issn: 2227-9717
  databaseCode: BENPR
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 2227-9717
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000913856
  issn: 2227-9717
  databaseCode: 8FG
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NbtNAEB7R5AA9FFqoSCnRSlSCHtzG3rW9PqG0SpoiNUSkQeVk7a7XpWrqWIkDCgfEQ_CEPAkziVNChRASkg-2PLtea352xp75BmDPFcoKXypHBkHkCJ3gmbDWCdNI6siVWrlUO3zWDToD8ebCv1ip4qe0SgzFr-ZGmuo0nQgDDtRtOrxG6B3mSfr6U_ktif55oTajm7AG1cBHb7wC1UG31_xAPeWWoxeopByj-8N87BKIWiP0ftuH7lrjdbg_zXI1-6yGw5Xtpv0Q1HKhiyyT64NpoQ_MlzsYjv_zJo9go_RFWXMhPJtwz2ZbsL6CULgFm6XuT9irEqB6_zFcH48mBXuLxuYGh_cWmLE4vdNHCUgotf2SUY-1ITvCPTJho4y97_adbv-k6Zyess6MqsRYc3g5Gl8VH29-fPtO2YwzojufywHrqdyOGdUpPoFBu3V-3HHKpg2O4VwUDjdWJm4k50B_wngiSXki_dCGjcgGHt7lhmvkQsLRPbAY_hhXRa4xOrV-ylO-DZVslNmnwFLNuUshUxpokbgNmQobSYNsVlaHmtdgf8nC2JSI5tRYYxhjZEPsjn-xuwYvbmnzBY7HH6lekiTEpNw4k1FljQKuh2Cy4mYoMEL0IunXYHcpLHGp9ZPYCz3pk4OKE-3dCtBfnrfzb2TP4IFHVRfzHMJdqBTjqX2OvlCh67Am2yd1qB61ur13eHX2tVUvVeAnBD4FnQ
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1RT9RAEJ4gPCAPBlDjKeomYpSHhuvutt0-EHIgeCdQL95heKvtdouJpVfvSsi9-SP8Pf4Yf4kzvfZAY3jjrUm322a-2Zmd7cw3AJu2jIx0VGQp1_UtGSd4JY2xvNRXsW-rOLKpdvgkcLun8sOZc7YAv5paGEqrbGxiZaiTkaYz8m3uceWQ8-e7xXeLukbR39WmhUZUt1ZIdiqKsbqw48hMrzCEm-z03iHerzk_PBjud626y4ClhZClJbRRCYbeFTOd1FwmqUiU4xmv7RuX412hRYyamwj0Zwb369qOfFvrODVOKlKB896DJSmkj8Hf0t5B0P80P-Uh1k3luDNeVCH89nYxtonGre3xvzzhv_5gBZYv8yKaXkVZdsPhHa7Cg3qnyjoz1VqDBZOvw8oN_sJ1WKstw4S9remrtx7Ct_3RpGQf0RRd4OP9GaMsom8NUD8SSnw_Z9SBLWN76EETNsrZ52BgBYP3HavXY90p1ZCxTnaO0i-_Xvz-8ZNyHac0blhpCetHhRkzqmJ8BKd3IuzHsJiPcvMEWBoLYVNAlbqxTOy2SqXxlXZ8NzKxF4sWbDXiDXXNd05tN7IQ4x6CIryGogWv5mOLGcvHf0e9IZRCWvo4k47qCgb8HiLRCjuexPiR-8ppwUYDZFjbhEl4rcEt2JyDe8v7nt4-y0tY7g5PjsPjXnD0DO5zqsuosgw3YLEcX5rnuFsq4xe1SjL4cter4A8ZZicZ
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3BbtNAEB2VIgE9IFpABAqsRBH0YCXeXdvrA0KhJU0ohEhpq96Md70uEq5jEldVbnwEX8Pn8CXM2E5aEOqtN0ter62ZtzM765k3AFuujK30VOwo3w8dqRO8ktY6QRoqHbpKxy7VDn8a-v1D-eHYO16BX4taGEqrXNjEylAnE0Nn5G0ecOWR8-fttEmLGO323hbfHeogRX9aF-00aojs2_k5hm-zN4Nd1PVLznvvD3b6TtNhwDFCyNIRxqoEw-6KlU4aLpNUJMoLbNAJrc_xrjBCI2oTgb7M4l7duHHoGqNT66UiFTjvDbgZEIs7Van39pbnO8S3qTy_ZkQVIuy0i6lLBG6dgP_lA__1BGtw-ywv4vl5nGWXXF3vHtxt9qisW4NqHVZsvgFrl5gLN2C9sQkz9rohrt6-D992JrOSfUYjdIqPj2ouWdS7M0ZkJJTyfsKo91rG3qHvTNgkZ0fDsTMc73WdwYD151Q9xrrZCcq6_Hr6-8dPynKc07iDCh9sFBd2yqh-8QEcXouoH8JqPsntI2CpFsKlUCr1tUzcjkqlDZXxQj-2OtCiBdsL8UamYTqnhhtZhBEPqSK6UEULXizHFjW_x39HvSItRbTocSYTN7UL-D1EnxV1A4mRIw-V14LNhSKjxhrMogvstmBrqdwr3vf46lmewy3EfvRxMNx_Anc4FWRU6YWbsFpOz-xT3CaV-lmFRwZfrnsB_AEFrCSz
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Rb9MwED5B9wB7ADaYKBvIEpNgD96a2EmcJxQmRodEqdQVjafIdpwxrUujNh0qT_wIfiG_hLsmHWVCCAkpD5FycRzdd_ZdcvcdwK4ntZOB0lyFYcylyfBMOsejPFYm9pTRHtUOv--F3aF8dxqcrlTxU1olhuLni0Wa6jR5jAEH2jYdfifyD8osf3XVfEuif15ozegm3Ia1MEBvvAVrw14_-UQ95ZZ316ykAqP7g3LiEYlaJ_J_24dursbrcGdWlHr-RY9GK9vN0X3Qy4nWWSYX-7PK7NuvNzgc_-dNHsC9xhdlSQ2eDbjlik1YX2Eo3ISNxvan7GVDUL33EC4Ox9OKfcDF5hJv79ecsTg8HyACMkptP2PUY23EXuMembFxwT72Brw3eJvw42PWnVOVGEtGZ-PJefX58se375TNOCe5kwUOWF-XbsKoTvERDI_enBx2edO0gVshZMWFdSrzYrUg-pPWl1kuMhVELurELvTxqrDCoBYyge6Bw_DHejr2rDW5C3KRiy1oFePCPQaWGyE8Cpny0MjM66hculhZVLN2JjKiDXtLFaa2YTSnxhqjFCMbUnf6S91teH4tW9Y8Hn-UekFISMm4cSSrmxoFnA_RZKVJJDFC9GMVtGFnCZa0sfpp6ke-CshBxYF2rwH0l-c9-TexbbjrU9XFIodwB1rVZOaeoi9UmWcN3H8CwVwB7A
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=Cost+Optimal+Production-Scheduling+Model+Based+on+VNS-NSGA-II+Hybrid+Algorithm%E2%80%94Study+on+Tissue+Paper+Mill&rft.jtitle=Processes&rft.au=Zhang%2C+Huanhuan&rft.au=Li%2C+Jigeng&rft.au=Hong%2C+Mengna&rft.au=Man%2C+Yi&rft.date=2022-10-01&rft.issn=2227-9717&rft.eissn=2227-9717&rft.volume=10&rft.issue=10&rft.spage=2072&rft_id=info:doi/10.3390%2Fpr10102072&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_pr10102072
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-9717&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-9717&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-9717&client=summon