Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm

The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignmen...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of advanced manufacturing technology Vol. 73; no. 1-4; pp. 3 - 21
Main Authors:	Pérez-Rodríguez, Ricardo, Jöns, S., Hernández-Aguirre, Arturo, Alberto-Ochoa, Carlos
Format:	Journal Article
Language:	English
Published:	London Springer London 01-07-2014 Springer Nature B.V
Subjects:	Algorithms CAE) and Design Computer simulation Computer-Aided Engineering (CAD Engineering Industrial and Production Engineering Mechanical Engineering Media Management Optimization Original Article Production scheduling Schedules Scheduling Simulation Scheduling Flexible jobshop scheduling problem Simulation optimization Estimation of distribution algorithm Work in process Event-discrete simulation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignment mentioned is a difficult task to implement on real manufacturing environments because there are many assumptions to satisfy, especially when the amount of work is not constant or sufficient to keep the manufacturing process busy for a long time, causing intermittent idle times. An estimation of distribution algorithm-based approach coupled with a simulation model is developed to solve the problem and implement the solution. Using the proposed approach, the shop performance can be noticeably improved when different machines are assigned to different schedules.
AbstractList	The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignment mentioned is a difficult task to implement on real manufacturing environments because there are many assumptions to satisfy, especially when the amount of work is not constant or sufficient to keep the manufacturing process busy for a long time, causing intermittent idle times. An estimation of distribution algorithm-based approach coupled with a simulation model is developed to solve the problem and implement the solution. Using the proposed approach, the shop performance can be noticeably improved when different machines are assigned to different schedules.
Author	Pérez-Rodríguez, Ricardo Hernández-Aguirre, Arturo Jöns, S. Alberto-Ochoa, Carlos
Author_xml	– sequence: 1 givenname: Ricardo surname: Pérez-Rodríguez fullname: Pérez-Rodríguez, Ricardo email: rperez.picyt@ciatec.mx organization: CIATEC – sequence: 2 givenname: S. surname: Jöns fullname: Jöns, S. organization: UPGTO, CONACYT – sequence: 3 givenname: Arturo surname: Hernández-Aguirre fullname: Hernández-Aguirre, Arturo organization: CIMAT – sequence: 4 givenname: Carlos surname: Alberto-Ochoa fullname: Alberto-Ochoa, Carlos organization: UACJ
BookMark	eNp1UMtOwzAQtFCRaAsfwM0SZ4Mfie0cUcVLqsSB3q087NZVYgc7kQpfj0MqceK0Gu3M7OyswMJ5pwG4JfieYCweIsZEYIRJhnKRF-h0AZYkYwwxTPIFWGLKJWKCyyuwivGY2JxwuQT-w3ZjWw7WO-j7wXb2ewbGB1hC0-qTrVoNj76KB9_DWB90M7bW7WEffNp0cIwTKh3UMenPVgY2Ng7BVuMvLtu9D3Y4dNfg0pRt1DfnuQa756fd5hVt31_eNo9bVDPJByRxI2vKCkolx4LKusAlIznPaiGbTHJKG6mJbkyZa0OFznIiKasrSQ0XsmBrcDfbppCfYwqmjn4MLl1UlPLJOMMTi8ysOvgYgzaqD-mD8KUIVlOtaq5VpVrVVKs6JQ2dNTFx3V6HP-f_RT-_1H6h
CitedBy_id	crossref_primary_10_1007_s00170_015_7987_0 crossref_primary_10_1016_j_asoc_2015_12_017 crossref_primary_10_1016_j_cie_2024_109950 crossref_primary_10_1016_j_asoc_2015_08_057 crossref_primary_10_1016_j_asoc_2014_11_011 crossref_primary_10_1016_j_jestch_2015_11_004 crossref_primary_10_15446_dyna_v82n191_51141 crossref_primary_10_1007_s00170_015_6835_6 crossref_primary_10_1007_s11590_023_02077_7 crossref_primary_10_1016_j_asoc_2016_09_051 crossref_primary_10_1007_s00170_015_6981_x crossref_primary_10_1108_IJLM_11_2015_0204 crossref_primary_10_1155_2021_6639769 crossref_primary_10_1016_j_jii_2024_100599 crossref_primary_10_3390_mca26030064
Cites_doi	10.1109/WSC.2007.4419595 10.1109/WSC.1989.718728 10.1016/j.cie.2011.01.005 10.1109/WSC.2005.1574490 10.1016/j.omega.2011.05.002 10.1109/IEEM.2007.4419506 10.1080/09591120010021793 10.1007/978-3-540-24677-0_38 10.1080/00207540500076530 10.1016/j.cie.2011.11.002 10.1016/j.eswa.2010.02.073 10.1080/09511920310001617022 10.2507/IJSIMM09(3)4.162 10.1016/j.cor.2011.08.016 10.1016/j.eswa.2010.09.104 10.1080/00207540500386012 10.1016/j.cor.2008.11.004 10.1016/j.cie.2011.12.014 10.1007/s10696-011-9099-y
ContentType	Journal Article
Copyright	Springer-Verlag London 2014 The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2014). All Rights Reserved.
Copyright_xml	– notice: Springer-Verlag London 2014 – notice: The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2014). All Rights Reserved.
DBID	AAYXX CITATION 8FE 8FG ABJCF AFKRA BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PQEST PQQKQ PQUKI PRINS PTHSS
DOI	10.1007/s00170-014-5759-x
DatabaseName	CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection
DatabaseTitle	CrossRef Engineering Database Technology Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic Engineering Collection
DatabaseTitleList	Engineering Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1433-3015
EndPage	21
ExternalDocumentID	10_1007_s00170_014_5759_x
GroupedDBID	-5B -5G -BR -EM -XW -XX -Y2 -~C .86 .VR 06D 0R~ 0VY 123 1N0 1SB 203 28- 29J 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X 9M8 AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABBXA ABDBF ABDEX ABDZT ABECU ABFGW ABFTD ABFTV ABHQN ABJCF ABJNI ABJOX ABKAG ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABPTK ABQBU ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACBMV ACBRV ACBXY ACBYP ACGFS ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACTTH ACVWB ACWMK ADHHG ADHIR ADINQ ADKNI ADKPE ADMDM ADMVV ADOXG ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AEKVL AENEX AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFEXP AFGCZ AFKRA AFLOW AFNRJ AFQWF AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCEE ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBLON EBS EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW L6V LAS LLZTM M4Y M7S MA- ML~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9P PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCV SDH SDM SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z85 Z86 Z88 Z8M Z8N Z8P Z8Q Z8R Z8S Z8T Z8U Z8V Z8W Z8Z Z92 ZMTXR ZY4 _50 ~8M ~A9 ~EX AACDK AAEOY AAJBT AASML AAYXX AAYZH ABAKF ABYXP ACAOD ACDTI ACZOJ AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU CITATION H13 DWQXO PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c386t-80d8c23922860728c90a31564c78d48622d8e1edfa5ef27e451823cb82f67893
IEDL.DBID	AEJHL
ISSN	0268-3768
IngestDate	Mon Nov 04 11:25:24 EST 2024 Thu Nov 21 21:36:26 EST 2024 Sat Dec 16 12:04:39 EST 2023
IsPeerReviewed	true
IsScholarly	true
Issue	1-4
Keywords	Scheduling Flexible jobshop scheduling problem Simulation optimization Estimation of distribution algorithm Work in process Event-discrete simulation
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c386t-80d8c23922860728c90a31564c78d48622d8e1edfa5ef27e451823cb82f67893
PQID	2262392409
PQPubID	2044010
PageCount	19
ParticipantIDs	proquest_journals_2262392409 crossref_primary_10_1007_s00170_014_5759_x springer_journals_10_1007_s00170_014_5759_x
PublicationCentury	2000
PublicationDate	2014-07-01
PublicationDateYYYYMMDD	2014-07-01
PublicationDate_xml	– month: 07 year: 2014 text: 2014-07-01 day: 01
PublicationDecade	2010
PublicationPlace	London
PublicationPlace_xml	– name: London – name: Heidelberg
PublicationTitle	International journal of advanced manufacturing technology
PublicationTitleAbbrev	Int J Adv Manuf Technol
PublicationYear	2014
Publisher	Springer London Springer Nature B.V
Publisher_xml	– name: Springer London – name: Springer Nature B.V
References	Rudolph G (1991) Global optimization by means of distributed evolution strategies. Parallel problem solving from nature PPSN I. Lectures notes in computer science Whitner R, Balci O (1989) Guidelines for selecting and using simulation model verification techniques. Proceedings of the 1989 Winter Simulation Conference. Washington ChenYMChenMCChangPCChenSHExtended artificial chromosomes genetic algorithm for permutation flowshop scheduling problemsComput Ind Eng20126253654510.1016/j.cie.2011.11.002 ZhangYLiXEstimation of distribution algorithm for permutation flow shops with total flowtime minimizationComput Ind Eng20116070671810.1016/j.cie.2011.01.005 WangLWangSXuYZhouGLiuMA bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problemComput Ind Eng20126291792610.1016/j.cie.2011.12.014 JarbouiVEddalyMSiarryPAn estimation of distribution algorithm for minimizing the total flow time in permutation flowshop scheduling problemsComput Oper Res2009362638264610.1016/j.cor.2008.11.0041179.901382586529 ChanFTSWongTCChanLYFlexible job-shop scheduling problem under resource constraintsInt J Prod Res200644112071208910.1080/002075405003860121095.90035 ChanFTSChungSHA multi-criterion genetic algorithm for order distribution in a demand driven supply chainInt J Comput Integr Manuf200417433935110.1080/09511920310001617022 WadhwaSRaoKSChanFTSFlexibility-enabled lead-time reduction in flexible systemsInt J Prod Res200543153131316210.1080/00207540500076530 Greenwood A, Vanguri S, Eksioglu B, Jain P, Hill T, Miller J, Walden C (2005) Simulation optimization decision support system for ship panel shop operations. Proceedings of the 2005 Winter Simulation Conference Baluja S, Davies S (1997) Combining multiple optimization runs with optimal dependency trees. Carnegie Mellon University Sargent R (2007) Verification & validation of simulation models. Proceedings of the 2007 Winter Simulation Conference ShimVAChen TanKYong ChiaJKiat ChongJEvolutionary algorithms for solving multi-objective travelling salesman problemFlex Serv Manuf J20112320724110.1007/s10696-011-9099-y1230.90172 LiuHGaoLPanQA hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problemExpert Syst Appl2011384348436010.1016/j.eswa.2010.09.104 Mühlenbein H, Paaß G (1996) From recombination of genes to the estimation of distributions: I. Binary parameters. Parallel problem solving from nature PPSN IV, 178–187 ChenSHChenMCChangPCZhangQChenYMGuidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problemsExpert Syst Appl2010376441645110.1016/j.eswa.2010.02.073 Peña J, Robles V, Larrañaga P, Herves V, Rosales F, Pérez M (2004) Ga-eda: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms. Innovations in Applied Artificial Intelligence. Berlin/Heidelberg PitaJWangQA simulation approach to facilitate manufacturing system designInt J Simul Model20109–315216410.2507/IJSIMM09(3)4.162 PinedoMScheduling2001New YorkSpringer Science + Business Media Whitley D, Starweather T, Shaner D (1990) The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination. In: L. Davis (Ed.), Handbook of genetic algorithms, (pp. 350–372). New York Larrañaga P, Exteberria R, Lozano J, Peña J (2000) Optimization in continuous domains by learning and simulation of Gaussian networks. Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program Bean J, Norman B (1993) Random keys for job shop scheduling problem. The University of Michigan ChenSHChangPCChengTZhangQA self-guided genetic algorithm for permutation flowshop scheduling problemsComput Oper Res2012391450145710.1016/j.cor.2011.08.0161251.901222859543 ChanFTSThe effects of routing flexibility on a flexible manufacturing systemInt J Comput Integr Manuf200114543144510.1080/09591120010021793 PanQKRuizRAn estimation of distribution algorithm for lot-streaming flow shop problems with setup timesOmega20124016618010.1016/j.omega.2011.05.002 Yan Y, Wang G (2007) A job shop scheduling approach based on simulation optimization. Proceedings of the 2007 I.E. IEEM De Bonet J, Isbell C, Viola P (1997) MIMIC: finding optima by estimation probability densities. Adv Neural Inf Process Syst 9 L Wang (5759_CR6) 2012; 62 FTS Chan (5759_CR13) 2001; 14 5759_CR20 VA Shim (5759_CR15) 2011; 23 5759_CR21 S Wadhwa (5759_CR11) 2005; 43 M Pinedo (5759_CR26) 2001 5759_CR27 Y Zhang (5759_CR9) 2011; 60 5759_CR22 QK Pan (5759_CR4) 2012; 40 5759_CR23 5759_CR24 FTS Chan (5759_CR12) 2004; 17 5759_CR25 J Pita (5759_CR19) 2010; 9–3 YM Chen (5759_CR7) 2012; 62 V Jarboui (5759_CR8) 2009; 36 FTS Chan (5759_CR10) 2006; 44 SH Chen (5759_CR5) 2012; 39 5759_CR16 5759_CR17 5759_CR18 5759_CR1 SH Chen (5759_CR2) 2010; 37 H Liu (5759_CR3) 2011; 38 5759_CR14
References_xml	– ident: 5759_CR17 doi: 10.1109/WSC.2007.4419595 – ident: 5759_CR18 doi: 10.1109/WSC.1989.718728 – volume: 60 start-page: 706 year: 2011 ident: 5759_CR9 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.01.005 contributor: fullname: Y Zhang – ident: 5759_CR20 doi: 10.1109/WSC.2005.1574490 – volume: 40 start-page: 166 year: 2012 ident: 5759_CR4 publication-title: Omega doi: 10.1016/j.omega.2011.05.002 contributor: fullname: QK Pan – ident: 5759_CR22 – ident: 5759_CR24 – ident: 5759_CR16 doi: 10.1109/IEEM.2007.4419506 – volume: 14 start-page: 431 issue: 5 year: 2001 ident: 5759_CR13 publication-title: Int J Comput Integr Manuf doi: 10.1080/09591120010021793 contributor: fullname: FTS Chan – ident: 5759_CR14 doi: 10.1007/978-3-540-24677-0_38 – volume: 43 start-page: 3131 issue: 15 year: 2005 ident: 5759_CR11 publication-title: Int J Prod Res doi: 10.1080/00207540500076530 contributor: fullname: S Wadhwa – volume: 62 start-page: 536 year: 2012 ident: 5759_CR7 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.11.002 contributor: fullname: YM Chen – volume: 37 start-page: 6441 year: 2010 ident: 5759_CR2 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.02.073 contributor: fullname: SH Chen – volume: 17 start-page: 339 issue: 4 year: 2004 ident: 5759_CR12 publication-title: Int J Comput Integr Manuf doi: 10.1080/09511920310001617022 contributor: fullname: FTS Chan – volume: 9–3 start-page: 152 year: 2010 ident: 5759_CR19 publication-title: Int J Simul Model doi: 10.2507/IJSIMM09(3)4.162 contributor: fullname: J Pita – volume: 39 start-page: 1450 year: 2012 ident: 5759_CR5 publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.08.016 contributor: fullname: SH Chen – ident: 5759_CR27 – ident: 5759_CR1 – volume: 38 start-page: 4348 year: 2011 ident: 5759_CR3 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2010.09.104 contributor: fullname: H Liu – volume: 44 start-page: 2071 issue: 11 year: 2006 ident: 5759_CR10 publication-title: Int J Prod Res doi: 10.1080/00207540500386012 contributor: fullname: FTS Chan – ident: 5759_CR23 – volume: 36 start-page: 2638 year: 2009 ident: 5759_CR8 publication-title: Comput Oper Res doi: 10.1016/j.cor.2008.11.004 contributor: fullname: V Jarboui – ident: 5759_CR21 – volume: 62 start-page: 917 year: 2012 ident: 5759_CR6 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.12.014 contributor: fullname: L Wang – volume-title: Scheduling year: 2001 ident: 5759_CR26 contributor: fullname: M Pinedo – volume: 23 start-page: 207 year: 2011 ident: 5759_CR15 publication-title: Flex Serv Manuf J doi: 10.1007/s10696-011-9099-y contributor: fullname: VA Shim – ident: 5759_CR25
SSID	ssj0016168 ssib034539549 ssib019759004 ssib029851711
Score	2.203935
Snippet	The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing...
SourceID	proquest crossref springer
SourceType	Aggregation Database Publisher
StartPage	3
SubjectTerms	Algorithms CAE) and Design Computer simulation Computer-Aided Engineering (CAD Engineering Industrial and Production Engineering Mechanical Engineering Media Management Optimization Original Article Production scheduling Schedules Scheduling Simulation
Title	Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm
URI	https://link.springer.com/article/10.1007/s00170-014-5759-x https://www.proquest.com/docview/2262392409
Volume	73
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
link	http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwELWgXWDgG1EoyAMTKKhxnNgZK2gpCLG0A1tkO05baJKqHxI_n3PqpIBggClDIic5n3P3cr73ELpkgUwCLrmjhK8cqgRxhICFJwLKAuYS6clCxLbPnl_4XcfQ5JDq10X2dlNWJIsPddXrVjC9APKljtGUdCBvrEPo8cG36-3OY--p9CI3ZEYJs_IyEhr5-bUXe9T3VrUtW2sI3KJhDsAIN8uNl7XPn276NXqtU9JvVdQiOHV3__Nae2jHpqK4vfKdfbShswO0_Ymg8BDl_XFq9b1wDh-X1HZtYkh1scCJYdOUE41fczkf5VMMUBlCl-lwx1apBpuN9UMsMmzoPFI7VIJjQ9hrtbawmAzz2XgxSo_QoNsZ3PYcK9HgKI8HC4hvMVcEcizCgxYjXIUt4Rn-GcV4TAEtkZhrV8eJ8HVCmKY-4BlPSU4SiJKhd4xqWZ7pE4QF1SEDcKVcFVKuQ86pYaeTWrgsocxvoKvS8tF0RcQRVZTLhREjMGJkjBi9N1CznJvIrsl5BImmeVIAtA10XU7G-vSvg53-6eoztEXMbBY7epuotpgt9TnanMfLC-uo5vgwuO9-ACrC4NI
link.rule.ids	315,782,786,27933,27934,41073,42142,48344,48347,48357,49649,49652,49662,52153
linkProvider	Springer Nature
linkToHtml	http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED1BOwAD34jy6YEJFKlxnNgZKwoCUVjoAJNlO04Log2ircTP55w6LSAYYE5kJ-ez757O9x7ACU90nggtAqNiEzCjaKAUbjyVMJ7wkOpIlyK29_zuQbQvHE1OVPXClLfdq5JkeVLPmt1KqheEvixwopIBJo51R3ZOa1BvPTw-tis3ClPupDBnbkZTpz8_d-OIxdG0uOWLDUlYdswhGhFuv4mq-PnTpF_D1zwn_VZGLaPT5dq__msdVn0ySlpT79mABTvchJVPFIVbUNw_DbzCFynweBn4vk2CyS5RJHd8mvrFkudCj_rFK0GwjMHL9bgTr1VD3NX6HlFD4gg9Bn6onGSOsterbRH10ivensb9wTZ0Ly-651eBF2kITCSSMUa4TBiKWRYVSZNTYdKmihwDjeEiY4iXaCZsaLNcxTan3LIYEU1ktKA5xsk02oHasBjaXSCK2ZQjvDKhSZmwqRDM8dNpq0KeMx434LQyvXydUnHIGelyaUSJRpTOiPK9AQfV4ki_K0cSU033pQhpG3BWLcb88a-D7f3p7WNYuuredmTn-u5mH5apW9nyfu8B1MZvE3sIi6NscuS99gPvb-N2
linkToPdf	http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgkxAceCPGMwdOoAqapk16QhMwQCCExA7cqjRNeYi1ExsSPx-7SzdAcECcWyVt7NT-6vj7APZklOaRSpVndGg8YTT3tMaNpyMhI-nzNEgrEds7eXOvTs-IJue47oWpTrvXJclRTwOxNBXDw36WH44b3yraF4TBwiOBSQ-TyCb9FRMNaLYvu-ed2qX8WJIs5tjleExa9BOXDkQYjApdrvAQ-VX3HCITRXtP1YXQnyb9Gsom-em3kmoVqToL_37HRZh3SSprj7xqCaZssQxzn6gLV6C8e-o55S9W4men5_o5GSbBTLOceDbTF8uey3TwWPYZgmgMatT7zpyGDaMj9w9MF4yIPnpuqJxlROXrVLiYfnkoX5-Gj71V6HbOuicXnhNv8EygoiFGvkwZjtkXV9GR5MrERzogZhojVSYQR_FMWd9muQ5tzqUVISKdwKSK5xg_42ANGkVZ2HVgWthYIuwyvomFsrFSgnjrUqt9mQsZtmC_NkPSH1F0JGMy5moRE1zEhBYxeW_BVm2oxO3WQYIpKD0pQt0WHNSGmVz-dbCNP929CzO3p53k-vLmahNmORm2Ova7BY3h65vdhulB9rbjHPgDKCTsDQ
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=Simulation+optimization+for+a+flexible+jobshop+scheduling+problem+using+an+estimation+of+distribution+algorithm&rft.jtitle=International+journal+of+advanced+manufacturing+technology&rft.au=P%C3%A9rez-Rodr%C3%ADguez%2C+Ricardo&rft.au=J%C3%B6ns%2C+S.&rft.au=Hern%C3%A1ndez-Aguirre%2C+Arturo&rft.au=Alberto-Ochoa%2C+Carlos&rft.date=2014-07-01&rft.pub=Springer+London&rft.issn=0268-3768&rft.eissn=1433-3015&rft.volume=73&rft.issue=1-4&rft.spage=3&rft.epage=21&rft_id=info:doi/10.1007%2Fs00170-014-5759-x&rft.externalDocID=10_1007_s00170_014_5759_x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0268-3768&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0268-3768&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0268-3768&client=summon