{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:47:17Z","timestamp":1725911237984},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319677910"},{"type":"electronic","value":"9783319677927"}],"license":[{"start":{"date-parts":[[2017,9,20]],"date-time":"2017-09-20T00:00:00Z","timestamp":1505865600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-67792-7_49","type":"book-chapter","created":{"date-parts":[[2017,9,19]],"date-time":"2017-09-19T03:25:03Z","timestamp":1505791503000},"page":"502-512","source":"Crossref","is-referenced-by-count":1,"title":["Behind the Scenes of Deadline24: A Memetic Algorithm for the Modified Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Nalepa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Cwiek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukasz","family":"Zak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,20]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.ins.2014.03.060","volume":"278","author":"S Abdullah","year":"2014","unstructured":"Abdullah, S., Abdolrazzagh-Nezhad, M.: Fuzzy job-shop scheduling problems: a review. Inf. Sci. 278, 380\u2013407 (2014)","journal-title":"Inf. Sci."},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Artigues, C., Belmokhtar, S., Feillet, D.: An exact solution algorithm for the job shop problem with sequence-dependent setup times. In: R\u00e9gin, J.C., Rueher, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 3011, pp. 37\u201349. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24664-0_3"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Bhatt, N., Chauhan, N.R.: Genetic algorithm applications on job shop scheduling problem: a review. In: ICSCTI 2015, Faridabad, India, pp. 7\u201314 (2015)","DOI":"10.1109\/ICSCTI.2015.7489556"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Cinar, D., Topcu, Y.I., Oliveira, J.A.: A taxonomy for the flexible job shop scheduling problem. In: Migdalas, A., Karakitsiou, A. (eds.) Optimization, Control, and Applications in the Information Age. PROMS, vol. 130, pp. 17\u201337. Springer, Switzerland (2015)","DOI":"10.1007\/978-3-319-18567-5_2"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Cwiek, M., Nalepa, J.: A fast genetic algorithm for the flexible job shop scheduling problem. In: GECCO 2014, Vancouver, Canada, pp. 1449\u20131450 (2014)","DOI":"10.1145\/2598394.2602280"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Cwiek, M., Nalepa, J., Dublanski, M.: How to generate benchmarks for rich routing problems? In: Nguyen, N.T., Trawi\u0144ski, B., Fujita, H., Hong, T.P. (eds.) Intelligent Information and Database Systems. LNCS, vol. 9621, pp. 399\u2013409. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49381-6_38"},{"issue":"3","key":"49_CR7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10732-008-9083-1","volume":"16","author":"MI Hosny","year":"2010","unstructured":"Hosny, M.I., Mumford, C.L.: The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms. J. Heuristics 16(3), 417\u2013439 (2010)","journal-title":"J. Heuristics"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Liu, F., Qi, Y., Xia, Z., Hao, H.: Discrete differential evolution algorithm for the job shop scheduling problem. In: GEC 2009, Shanghai, China, pp. 879\u2013882 (2009)","DOI":"10.1145\/1543834.1543965"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Masood, A., Mei, Y., Chen, G., Zhang, M.: Many-objective genetic programming for job-shop scheduling. In: IEEE CEC 2016, Vancouver, Canada, pp. 209\u2013216 (2016)","DOI":"10.1109\/CEC.2016.7743797"},{"issue":"6","key":"49_CR10","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft. Comput. 20(6), 2309\u20132327 (2016)","journal-title":"Soft. Comput."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Nalepa, J., Cwiek, M., Kawulok, M.: Adaptive memetic algorithm for the job shop scheduling problem. In: IJCNN 2015, Killarney, Ireland, pp. 1\u20138 (2015)","DOI":"10.1109\/IJCNN.2015.7280409"},{"issue":"9","key":"49_CR12","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/s00170-011-3437-9","volume":"58","author":"SHA Rahmati","year":"2012","unstructured":"Rahmati, S.H.A., Zandieh, M.: A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 58(9), 1115\u20131129 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Siminski, K.: Memetic neuro-fuzzy system with big-bang-big-crunch optimisation. In: Gruca, A., Brachman, A., Kozielski, S., Czach\u00f3rski, T. (eds.) Man-Machine Interactions 4. AISC, vol. 391, pp. 583\u2013592. Springer, Switzerland (2015)","DOI":"10.1007\/978-3-319-23437-3_50"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.procs.2013.09.245","volume":"20","author":"A Thammano","year":"2013","unstructured":"Thammano, A., Phu-ang, A.: A hybrid artificial bee colony algorithm with local search for flexible job-shop scheduling. Procedia Comput. Sci. 20, 96\u2013101 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"9","key":"49_CR15","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1007\/s00170-011-3665-z","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, G., Xu, Y., Liu, M.: An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. Int. J. Adv. Manuf. Technol. 60(9), 1111\u20131123 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"11","key":"49_CR16","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"C Zhang","year":"2007","unstructured":"Zhang, C., Li, P., Guan, Z., Rao, Y.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res. 34(11), 3229\u20133242 (2007)","journal-title":"Comput. Oper. Res."},{"key":"49_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.neucom.2013.05.063","volume":"137","author":"Y Zhou","year":"2014","unstructured":"Zhou, Y., Chen, H., Zhou, G.: Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137, 285\u2013292 (2014)","journal-title":"Neurocomputing"}],"container-title":["Advances in Intelligent Systems and Computing","Man-Machine Interactions 5"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67792-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T17:02:26Z","timestamp":1570122146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67792-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,20]]},"ISBN":["9783319677910","9783319677927"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67792-7_49","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,9,20]]}}}