{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T07:59:19Z","timestamp":1773475159077,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436871","type":"print"},{"value":"9783031436888","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43688-8_32","type":"book-chapter","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T07:03:11Z","timestamp":1694588591000},"page":"460-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mixed Integer Programming for\u00a0Integrated Flexible Job-Shop and\u00a0Operator Scheduling in\u00a0Flexible Manufacturing Systems"],"prefix":"10.1007","author":[{"given":"Reza","family":"Ghorbani Saber","sequence":"first","affiliation":[]},{"given":"Pieter","family":"Leyman","sequence":"additional","affiliation":[]},{"given":"El-Houssaine","family":"Aghezzaf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"32_CR1","unstructured":"Groover, M.P.: Automation, Production Systems, and Computer-Integrated Manufacturing. Pearson Education India (2016)"},{"key":"32_CR2","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman San Francisco (1979)"},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"issue":"1\u20133","key":"32_CR4","doi-asserted-by":"publisher","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.: A branch and bound algorithm for the job-shop scheduling problem. Discret. Appl. Math. 49(1\u20133), 107\u2013127 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"ED Taillard","year":"1994","unstructured":"Taillard, E.D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6(2), 108\u2013117 (1994)","journal-title":"ORSA J. Comput."},{"issue":"6","key":"32_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797\u2013813 (1996)","journal-title":"Manag. Sci."},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"JC Beck","year":"2011","unstructured":"Beck, J.C., Feng, T., Watson, J.-P.: Combining constraint programming and local search for job-shop scheduling. INFORMS J. Comput. 23(1), 1\u201314 (2011)","journal-title":"INFORMS J. Comput."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"W-Y Ku","year":"2016","unstructured":"Ku, W.-Y., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 165\u2013173 (2016)","journal-title":"Comput. Oper. Res."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Xiong, H., Shi, S., Ren, D., Hu, J.: A survey of job shop scheduling problem: the types and models. Computers Oper. Res. 105731 (2022)","DOI":"10.1016\/j.cor.2022.105731"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Oper. Res. 70, 281\u2013306 (1997)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0377-2217(95)00059-Y","volume":"86","author":"J Paulli","year":"1995","unstructured":"Paulli, J.: A hierarchical approach for the FMS scheduling problem. Eur. J. Oper. Res. 86(1), 32\u201342 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3\u201320 (2000)","journal-title":"J. Sched."},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.cie.2010.05.004","volume":"59","author":"W Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., Wodecki, M.: Parallel hybrid metaheuristics for the flexible job shop problem. Comput. Ind. Eng. 59(2), 323\u2013333 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoo.2021.0056","volume":"4","author":"B Naderi","year":"2022","unstructured":"Naderi, B., Roshanaei, V.: Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling. INFORMS J. Optim. 4(1), 1\u201328 (2022)","journal-title":"INFORMS J. Optim."},{"issue":"9","key":"32_CR15","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1080\/00207543.2013.849822","volume":"52","author":"D Lei","year":"2014","unstructured":"Lei, D., Guo, X.: Variable neighbourhood search for dual-resource constrained flexible job shop scheduling. Int. J. Prod. Res. 52(9), 2519\u20132529 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"32_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107557","volume":"160","author":"W Tan","year":"2021","unstructured":"Tan, W., Yuan, X., Wang, J., Zhang, X.: A fatigue-conscious dual resource constrained flexible job shop scheduling problem by enhanced NSGA-II: an application from casting workshop. Comput. Ind. Eng. 160, 107557 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"32_CR17","first-page":"1242","volume":"22","author":"M Yazdani","year":"2015","unstructured":"Yazdani, M., Zandieh, M., Tavakkoli-Moghaddam, R., Jolai, F.: Two meta-heuristic algorithms for the dual-resource constrained flexible job-shop scheduling problem. Scientia Iranica 22(3), 1242\u20131257 (2015)","journal-title":"Scientia Iranica"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-019-03196-0","volume":"291","author":"JL Andrade-Pineda","year":"2020","unstructured":"Andrade-Pineda, J.L., Canca, D., Gonzalez-R, P.L., Calle, M.: Scheduling a dual-resource flexible job shop with makespan and due date-related criteria. Ann. Oper. Res. 291, 5\u201335 (2020)","journal-title":"Ann. Oper. Res."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1016\/j.procs.2018.08.123","volume":"126","author":"M Dhiflaoui","year":"2018","unstructured":"Dhiflaoui, M., Nouri, H.E., Driss, O.B.: Dual-resource constraints in classical and flexible job shop problems: a state-of-the-art review. Procedia Comput. Sci. 126, 1507\u20131515 (2018)","journal-title":"Procedia Comput. Sci."},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00291-018-0537-z","volume":"41","author":"D Kress","year":"2019","unstructured":"Kress, D., M\u00fcller, D., Nossack, J.: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times. OR Spectr. 41, 179\u2013217 (2019)","journal-title":"OR Spectr."}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43688-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T07:27:01Z","timestamp":1694590021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43688-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436871","9783031436888"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43688-8_32","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Advances in Production Management Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apms2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.apms-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}