{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:15:42Z","timestamp":1720278942456},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T00:00:00Z","timestamp":1335312000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s12351-012-0125-y","type":"journal-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T05:42:17Z","timestamp":1335246137000},"page":"233-250","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Mariano","family":"Frutos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Tohm\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,25]]},"reference":[{"issue":"3","key":"125_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1998","unstructured":"Adams J, Balas E, Zawack D (1998) The shifting bottleneck procedure for job-shop scheduling. Manage Sci 34(3):391\u2013401","journal-title":"Manage Sci"},{"key":"125_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0925-5273(99)00014-6","volume":"63","author":"VA Armentano","year":"2000","unstructured":"Armentano VA, Scrich CR (2000) Tabu search for minimizing total tardiness in a job-shop. Int J Prod Econ 63:131\u2013140","journal-title":"Int J Prod Econ"},{"issue":"11","key":"125_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"125_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"JC Beck","year":"2007","unstructured":"Beck JC (2007) Solution-guided multi-point constructive search for job-shop scheduling. J Artif Intell Res 29:49\u201377","journal-title":"J Artif Intell Res"},{"issue":"2","key":"125_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00291-008-0147-2","volume":"31","author":"R Bihlmaier","year":"2009","unstructured":"Bihlmaier R, Koberstein A, Obst R (2009) Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty. OR Spectr 31(2):311\u2013336","journal-title":"OR Spectr"},{"key":"125_CR6","doi-asserted-by":"crossref","unstructured":"Bleuler S, Laumanns M, Thiele L, Zitzler E (2003) PISA: a platform and programming language independent interface for search algorithms. In: Proceedings of evolutionary multi-criterion optimization, pp 494\u2013508","DOI":"10.1007\/3-540-36970-8_35"},{"key":"125_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P Brucker","year":"1994","unstructured":"Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discret Appl Math 49:107\u2013127","journal-title":"Discret Appl Math"},{"issue":"3","key":"125_CR8","doi-asserted-by":"crossref","first-page":"5800","DOI":"10.1016\/j.eswa.2008.07.005","volume":"36","author":"J Chao-Hsien","year":"2009","unstructured":"Chao-Hsien J, Han-Chiang H (2009) A hybrid genetic algorithm for no-wait job shop scheduling problems. Expert Syst Appl 36(3):5800\u20135806","journal-title":"Expert Syst Appl"},{"issue":"2","key":"125_CR9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.rcim.2007.07.017","volume":"25","author":"L Chinyao","year":"2009","unstructured":"Chinyao L, Yuling Y (2009) Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robot Comput Integr Manuf 25(2):314\u2013322","journal-title":"Robot Comput Integr Manuf"},{"key":"125_CR10","volume-title":"Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation","author":"CA Coello Coello","year":"2006","unstructured":"Coello Coello CA, Lamont GB, Veldhuizen DA (2006) Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation. Springer, New York"},{"key":"125_CR11","unstructured":"Cort\u00e9s Rivera D, Coello Coello CA, Cort\u00e9s NC (2003) Use of an artificial immune system for job-shop scheduling. In: Proceedings of the second international conference on artificial immune systems, Edinburgh. Scotland, Lecture notes in computer science, vol. 2787. Springer, New York, pp 1\u201310"},{"issue":"1","key":"125_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F Croce","year":"1995","unstructured":"Croce F, Tadei R (1995) A genetic algorithm for the job-shop problem. Comput Oper Res 22(1):15\u201324","journal-title":"Comput Oper Res"},{"issue":"2","key":"125_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L Giovanni De","year":"2010","unstructured":"De Giovanni L, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible jobshop scheduling problem. Euro J Oper Res 200(2):395\u2013408","journal-title":"Euro J Oper Res"},{"issue":"2","key":"125_CR14","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGAII. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"125_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell Amico","year":"1993","unstructured":"Dell Amico M, Trubian M (1993) Applying Tabu search to the job-shop scheduling problem. Ann Oper Res 41:231\u2013252","journal-title":"Ann Oper Res"},{"key":"125_CR16","doi-asserted-by":"crossref","unstructured":"Della Croce F, Grosso A, Salassa F (2011) A matheuristic approach for the two-machine total completion time flow-shop problem. Ann Oper Res. Springer. Online First\u2122, 6 July 2011","DOI":"10.1007\/978-3-642-20364-0_4"},{"key":"125_CR17","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s10479-010-0751-9","volume":"181","author":"M Frutos","year":"2010","unstructured":"Frutos M, Olivera AC, Tohm\u00e9 F (2010) A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann Oper Res 181:745\u2013765","journal-title":"Ann Oper Res"},{"key":"125_CR3000","doi-asserted-by":"crossref","unstructured":"Giffler B, Thomson GL (1960) Algorithms for solving production scheduling problems. Oper Res 8:487\u2013503","DOI":"10.1287\/opre.8.4.487"},{"issue":"2","key":"125_CR18","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1016\/j.amc.2006.09.023","volume":"187","author":"J Heinonen","year":"2007","unstructured":"Heinonen J, Pettersson F (2007) Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Appl Math Comput 187(2):989\u2013998","journal-title":"Appl Math Comput"},{"key":"125_CR19","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223","DOI":"10.1109\/TEVC.2003.810752"},{"key":"125_CR1000","doi-asserted-by":"crossref","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Quart 1:61\u201368","DOI":"10.1002\/nav.3800010110"},{"key":"125_CR20","unstructured":"Knowles J, Thiele L, Zitzler E (2005) A tutorial on the performance assessment of stochastic multiobjective optimizers. Comput Eng Netw Lab. TIK-Report 214:1\u201335"},{"issue":"6","key":"125_CR21","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"Y Lin","year":"2011","unstructured":"Lin Y, Pfund M, Fowler J (2011) Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput Oper Res 38(6):901\u2013916","journal-title":"Comput Oper Res"},{"key":"125_CR22","doi-asserted-by":"crossref","unstructured":"Merkle D, Middendorf M (2001) A new approach to solve permutation scheduling problems with ant colony optimization. Appl Evol Comput (EvoWorkshops 2001) 2037:484\u2013494","DOI":"10.1007\/3-540-45365-2_50"},{"issue":"2","key":"125_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki E, Smutnicki C (2005) An advanced Tabu search algorithms for the job-shop problem. J Sched 8(2):145\u2013159","journal-title":"J Sched"},{"issue":"1","key":"125_CR24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S Panwalker","year":"1977","unstructured":"Panwalker S, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45\u201361","journal-title":"Oper Res"},{"key":"125_CR25","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison Wesley, USA"},{"issue":"4","key":"125_CR26","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park BJ, Choi HR, Kim HSA (2003) Hybrid genetic algorithm for the job-shop scheduling problems. Comput Ind Eng 45(4):597\u2013613","journal-title":"Comput Ind Eng"},{"key":"125_CR2000","unstructured":"Roy B, Sussman B (1964) Les probl\u00e8mes d'ordonnancement avec contraintes disjonctives. SEMA. Technical Report 9 bis:1\u201321"},{"key":"125_CR27","unstructured":"Sadeh NM, Fox MS (1995) Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem. Technical Report CMU-RI-TR 95-39"},{"key":"125_CR28","unstructured":"Srinivas N (1994) Multi-objective optimization using nondominated sorting in genetic algorithms. Master thesis. Indian Institute of Technology, Kanpur, India"},{"key":"125_CR29","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing instances with application to job-shop scheduling. Manage Sci 38:1495\u20131509","journal-title":"Manage Sci"},{"key":"125_CR30","unstructured":"T`kindt V, Billaut JC (2006) Multicriteria scheduling. Theory, models and algorithms. Springer, Germany"},{"key":"125_CR31","unstructured":"Tsai CF, Lin FC (2003) A new hybrid heuristic technique for solving job-shop scheduling problems. Second IEEE international workshop on intelligent data acquisition and advanced computing systems: technology and applications"},{"key":"125_CR32","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) NP-complete scheduling problems. J Comput Syst Sci 10:384\u2013393","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"125_CR33","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Laarhoven Van","year":"1992","unstructured":"Van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job-shop scheduling by simulated annealing. Oper Res 40(1):113\u2013125","journal-title":"Oper Res"},{"key":"125_CR34","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.ejor.2004.07.020","volume":"167","author":"TK Varadharajan","year":"2005","unstructured":"Varadharajan TK, Rajendran C (2005) A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Euro J Oper Res 167:772\u2013795","journal-title":"Euro J Oper Res"},{"key":"125_CR35","unstructured":"Wu CG, Xing XL, Lee HP, Zhou CG, Liang YC (2004) Genetic algorithm application on the job-shop scheduling problem. In: Proceedings of the 2004 international conference machine learning and cybernetics, vol 4, pp 2102\u20132106"},{"key":"125_CR36","doi-asserted-by":"crossref","DOI":"10.1049\/PBCE055E","volume-title":"Genetic algorithms in engineering systems","author":"AMS Zalzala","year":"1997","unstructured":"Zalzala AMS, Flemming PJ (1997) Genetic algorithms in engineering systems. London Institution of Electrical Engineers, London"},{"key":"125_CR37","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS\/SA algorithm for the job-shop scheduling problem. Comput Oper Res 35:282\u2013294","journal-title":"Comput Oper Res"},{"issue":"4","key":"125_CR38","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"125_CR39","unstructured":"Zitzler E, Laumanns M, Thiele L (2002) SPEAII: improving the strength pareto evolutionary algorithm for multiobjective optimization. In Giannakoglou, Tsahalis, Periaux, Papailiou, Fogarty (eds) Evolutionary methods for design. Optimisations and Control, pp 19\u201326"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-012-0125-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-012-0125-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-012-0125-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T19:45:40Z","timestamp":1561664740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-012-0125-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,25]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s12351-012-0125-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,25]]}}}