{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:33Z","timestamp":1742913213398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319897424"},{"type":"electronic","value":"9783319897431"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89743-1_34","type":"book-chapter","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T18:28:27Z","timestamp":1523471307000},"page":"387-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving an Integration Process Planning and Scheduling in a Flexible Job Shop Using a Hybrid Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-6177","authenticated-orcid":false,"given":"Nassima","family":"Keddari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2172-6252","authenticated-orcid":false,"given":"Nasser","family":"Mebarki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atif","family":"Shahzad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2338-4193","authenticated-orcid":false,"given":"Zaki","family":"Sari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"issue":"1\u20132","key":"34_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00170-004-2317-y","volume":"28","author":"M Kumar","year":"2006","unstructured":"Kumar, M., Rajotia, S.: Integration of process planning and scheduling in a job shop environment. Int. J. Adv. Manuf. Technol. 28(1\u20132), 109\u2013116 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"34_CR2","unstructured":"Tan, W.: Integration of process planning and scheduling. A mathematical programming approach. Ph.D. Dissertation, University of Southern California (1998)"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1008952024606","volume":"11","author":"W Tan","year":"2000","unstructured":"Tan, W., Khoshnevis, B.: Integration of process planning and scheduling \u2013 a review. J. Intell. Manuf. 11(1), 51\u201363 (2000)","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1080\/09511920600667366","volume":"20","author":"WD Li","year":"2007","unstructured":"Li, W.D., McMahon, C.A.: A simulated annealing-based optimization approach for integrated process planning and scheduling. Int. J. Comput. Integr. Manuf. 20(1), 80\u201395 (2007)","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"34_CR5","unstructured":"Samur, S., Bulkan, S.: An evolutionary solution to a multi-objective scheduling problem. In: Proceedings of the World Congress on Engineering 2010, WCE, vol. III (2010)"},{"key":"34_CR6","first-page":"445","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. Handb. Oper. Res. Manag. Sci. 4, 445\u2013522 (1993)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"34_CR7","unstructured":"Serbencu, A., Minzu, V., Serbencu, A.: An ant colony system based metaheuristic for solving single machine scheduling problem. Ann. Dunarea De Jos Univ. Galati Fascicle III 3(1), 19\u201324 (2007). ISSN 1221-454X"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/S0305-0548(02)00063-1","volume":"30","author":"YK Kim","year":"2003","unstructured":"Kim, Y.K., Park, K., Ko, J.: A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput. Oper. Res. 30, 1151\u20131171 (2003)","journal-title":"Comput. Oper. Res."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00170-013-5469-9","volume":"71","author":"M Haddadzade","year":"2014","unstructured":"Haddadzade, M., Razfar, M.R., Zarandi, M.H.F.: Integration of process planning and job shop scheduling with stochastic processing time. Int. J. Adv. Manuf. Technol. 71, 241\u2013252 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.18201\/ijisae.267358","volume":"4","author":"AR Botsali","year":"2016","unstructured":"Botsali, A.R.: Comparison of simulated annealing and genetic algorithm approaches on integrated process routing and scheduling problem. Int. J. Intell. Syst. Appl. Eng. Adv. Technol. Sci. 4, 101\u2013104 (2016). ISSN 2147-67992","journal-title":"Int. J. Intell. Syst. Appl. Eng. Adv. Technol. Sci."},{"issue":"6","key":"34_CR11","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2010.09.015","volume":"38","author":"K Bulbul","year":"2011","unstructured":"Bulbul, K.: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38(6), 967\u2013983 (2011)","journal-title":"Comput. Oper. Res."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.cor.2015.07.012","volume":"66","author":"R Braune","year":"2016","unstructured":"Braune, R., Zapfe, G.: Shifting Bottleneck scheduling for total weighted tardiness minimization: a computational evaluation of subproblem and re-optimization heuristics. Comput. Oper. Res. 66, 130\u2013140 (2016)","journal-title":"Comput. Oper. Res."},{"key":"34_CR13","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-95978-6_13","volume-title":"Intelligent and Evolutionary Systems","author":"M Gen","year":"2009","unstructured":"Gen, M., Gao, J., Lin, L.: Multistage-based genetic algorithm for flexible job-shop scheduling problem. In: Gen, M., et al. (eds.) Intelligent and Evolutionary Systems. Studies in Computational Intelligence, vol. 187, pp. 183\u2013196. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95978-6_13"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11941439_69","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"BJ Park","year":"2006","unstructured":"Park, B.J., Choi, H.R.: A genetic algorithm for integration of process planning and scheduling in a job shop. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 647\u2013657. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941439_69"},{"issue":"3","key":"34_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawac, D.: The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manag. Sci."},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier, J.: The one-machine sequencing problem. Eur. J. Oper. Res. 11(1), 42\u201347 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"34_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling Theory, Algorithms, and Systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling Theory, Algorithms, and Systems. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-2361-4"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"AS Jain","year":"1998","unstructured":"Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Eur. J. Oper. Res. 113, 390\u2013434 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang, C.Y., Li, P., Rao, Y., Guan, Z.: A very fast TS\/SA algorithm for the job shop scheduling problem. Comput. Oper. Res. 35(1), 282\u2013294 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"34_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1023\/A:1009617209268","volume":"6","author":"AS Jain","year":"2000","unstructured":"Jain, A.S., Rangaswamy, B., Meeran, S.: New and stronger job-shop neighborhoods: a focus on the method of Nowicki and Smutnicki. J. Heuristics 6(4), 457\u2013480 (2000)","journal-title":"J. Heuristics"},{"issue":"4\u20135","key":"34_CR21","first-page":"445","volume":"29","author":"G Fleury","year":"1995","unstructured":"Fleury, G.: Application des m\u00e9thodes stochastiques inspir\u00e9es du recuit simul\u00e9 \u00e0 des probl\u00e8mes d\u2019ordonnancement. Automatique Productique Informatique Industrielle 29(4\u20135), 445\u2013470 (1995)","journal-title":"Automatique Productique Informatique Industrielle"}],"container-title":["IFIP Advances in Information and Communication Technology","Computational Intelligence and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89743-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:48:59Z","timestamp":1709815739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89743-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319897424","9783319897431"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89743-1_34","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}