{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T17:11:52Z","timestamp":1721063512216},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2014,3,29]],"date-time":"2014-03-29T00:00:00Z","timestamp":1396051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s11042-014-1965-7","type":"journal-article","created":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T11:39:48Z","timestamp":1396006788000},"page":"3329-3343","source":"Crossref","is-referenced-by-count":8,"title":["Developing a job shop scheduling system through integration of graphic user interface and genetic algorithm"],"prefix":"10.1007","volume":"74","author":[{"given":"Jun Woo","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,29]]},"reference":[{"key":"1965_CR1","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.4236\/jsea.2010.312135","volume":"3","author":"R Abdelmaguid","year":"2010","unstructured":"Abdelmaguid R (2010) Representations in genetic algorithm for the job shop scheduling problem: a computational study. J Softw Eng Appl 3:1155\u20131162","journal-title":"J Softw Eng Appl"},{"key":"1965_CR2","first-page":"96","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinforma 3:96\u2013105","journal-title":"Int J Biom Bioinforma"},{"key":"1965_CR3","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.cie.2007.05.012","volume":"56","author":"F Altiparmak","year":"2009","unstructured":"Altiparmak F, Gen M, Lin L, Karaoglan I (2009) A steady state genetic algorithm for multi-product supply chain network design. Comput Ind Eng 56:521\u2013537","journal-title":"Comput Ind Eng"},{"key":"1965_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwirth","year":"1995","unstructured":"Bierwirth C (1995) A generalized permutation approach to job shop scheduling with genetic algorithms. Oper-Res-Spektrum 17:87\u201392","journal-title":"Oper-Res-Spektrum"},{"key":"1965_CR5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schile R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369\u2013375","journal-title":"Computing"},{"key":"1965_CR6","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"4","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms \u2013 I. Representation. Comput Ind Eng 4:983\u2013997","journal-title":"Comput Ind Eng"},{"key":"1965_CR7","unstructured":"Fang HL, Ross P, Corne D (1993) A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems, In: The 5th International Conference on Genetic Algorithms, 375-382"},{"key":"1965_CR8","unstructured":"Holland JH (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press"},{"key":"1965_CR9","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1016\/j.cor.2011.01.014","volume":"38","author":"M Kammer","year":"2011","unstructured":"Kammer M, Akker MVD, Hoogeveen H (2011) Identifying and exploiting commonalities for the job-shop scheduling problem. Comput Oper Res 38:1556\u20131561","journal-title":"Comput Oper Res"},{"key":"1965_CR10","first-page":"165","volume":"2","author":"JW Kim","year":"2012","unstructured":"Kim JW (2012) A simple job shop scheduling game for industrial engineering students. J Futur Game Technol 2:165\u2013171","journal-title":"J Futur Game Technol"},{"key":"1965_CR11","first-page":"12","volume-title":"Candidate order based genetic operators for sequencing problems","author":"JW Kim","year":"2013","unstructured":"Kim JW (2013) Candidate order based genetic operators for sequencing problems. International Conference on Intelligence Fusion, In, pp 12\u201313"},{"key":"1965_CR12","unstructured":"Kowalczyk R (1997) Constrained consistent genetic algorithms. IEEE International Conference on Evloutionary Computation, In, pp 343\u2013348"},{"key":"1965_CR13","doi-asserted-by":"crossref","unstructured":"Kozen D (1992) The design and analysis of algorithms, Springer","DOI":"10.1007\/978-1-4612-4400-4"},{"key":"1965_CR14","first-page":"91","volume":"22","author":"HP Lee","year":"2006","unstructured":"Lee HP, Carter JN (2006) A modified Giffler and Thompson genetic algorithm on the job shop scheduling problem. MATEMATIKA 22:91\u2013107","journal-title":"MATEMATIKA"},{"key":"1965_CR15","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra JK, Kan AR (1978) Complexity of scheduling under precedence constraints. Oper Res 26:22\u201335","journal-title":"Oper Res"},{"key":"1965_CR16","volume-title":"Industrial scheduling","author":"JF Muth","year":"1963","unstructured":"Muth JF, Thompson GL (1963) Industrial scheduling. Prentice Hall, New Jersey"},{"key":"1965_CR17","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35:3202\u20133212","journal-title":"Comput Oper Res"},{"key":"1965_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","volume":"22","author":"PW Poon","year":"1995","unstructured":"Poon PW, Carter JN (1995) Genetic algorithm crossover operators for ordering applications. Comput Oper Res 22:135\u2013147","journal-title":"Comput Oper Res"},{"key":"1965_CR19","first-page":"25","volume":"2","author":"JA Ruiz-Vanoye","year":"2011","unstructured":"Ruiz-Vanoye JA, Diza-Parra O, Zavala-Diaz JC (2011) Compexity indicators applied to the job shop scheduling problem to discriminate the best algorithm. Int J Comb Optim Probl Inform 2:25\u201331","journal-title":"Int J Comb Optim Probl Inform"},{"key":"1965_CR20","unstructured":"Starkweather T, MacDaniel S, Mathias KE, Whitely LD, Whitley C (1991) A comparison of genetic sequencing operators, In: The 4th International Conference on Genetic Algorithms, 69-76"},{"key":"1965_CR21","unstructured":"Werner F (2011) Genetic algorithms for shop scheduling problems: a survey. http:\/\/www.math.uni-magdeburg.de\/~werner\/preprints\/p11-31.pdf . Accessed 24 June 2013"},{"key":"1965_CR22","first-page":"281","volume":"2","author":"T Yamada","year":"1992","unstructured":"Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job-shop problems. Parallel Probl Solving from Nat 2:281\u2013290","journal-title":"Parallel Probl Solving from Nat"},{"key":"1965_CR23","first-page":"3562","volume":"38","author":"Z Zhang","year":"2011","unstructured":"Zhang Z, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38:3562\u20133573","journal-title":"Expert Syst Appl"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-014-1965-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-014-1965-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-014-1965-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:32:02Z","timestamp":1559359922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-014-1965-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,29]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1965"],"URL":"https:\/\/doi.org\/10.1007\/s11042-014-1965-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,29]]}}}