{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T00:24:15Z","timestamp":1717547055735},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This study addresses the problem of scheduling machining operations in a highly automated manufacturing environment while considering the work styles of workers. In actual manufacturing, many aspects of the operation must be considered, such as constraints related to the works to be machined in the machining schedule and the states of the workers. To derive good solutions for such a large-scale problem with many constraints within a realistic amount of computation time, we develop an optimization technique based on a mixed-integer programming (MIP)-based large neighborhood local search method for the machining scheduling problem. Then, computer experiments on a problem based on actual machining requirements are performed to verify the validity of the proposed method.<\/jats:p>","DOI":"10.1007\/s11227-024-05913-4","type":"journal-article","created":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T06:02:06Z","timestamp":1707544926000},"page":"12297-12312","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large neighborhood local search method with MIP techniques for large-scale machining scheduling with many constraints"],"prefix":"10.1007","volume":"80","author":[{"given":"Jin","family":"Matsuzaki","sequence":"first","affiliation":[]},{"given":"Kazutoshi","family":"Sakakibara","sequence":"additional","affiliation":[]},{"given":"Masaki","family":"Nakamura","sequence":"additional","affiliation":[]},{"given":"Shinya","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,10]]},"reference":[{"key":"5913_CR1","doi-asserted-by":"publisher","unstructured":"Gendreau M, Potvin JY (2010) Handbook of metaheuristics. Springer. https:\/\/doi.org\/10.1007\/978-3-319-91086-4","DOI":"10.1007\/978-3-319-91086-4"},{"key":"5913_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82\u2013117. https:\/\/doi.org\/10.1016\/j.ins.2013.02.041","journal-title":"Inf Sci"},{"key":"5913_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-014-1780-6","volume":"242","author":"W Ja\u015bkowski","year":"2015","unstructured":"Ja\u015bkowski W, Szubert M, Gawron P (2015) A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem. Ann Oper Res 242:33\u201362. https:\/\/doi.org\/10.1007\/s10479-014-1780-6","journal-title":"Ann Oper Res"},{"key":"5913_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna E, Rothberg E, Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71\u201390. https:\/\/doi.org\/10.1007\/s10107-004-0518-7","journal-title":"Math Program"},{"key":"5913_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118166000","author":"DS Chen","year":"2010","unstructured":"Chen DS, Baston RG, Dang Y (2010) Applied integer programming: modeling and solution. Wiley. https:\/\/doi.org\/10.1002\/9781118166000","journal-title":"Wiley"},{"key":"5913_CR6","doi-asserted-by":"publisher","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer. https:\/\/doi.org\/10.1007\/978-1-4614-2361-4","DOI":"10.1007\/978-1-4614-2361-4"},{"issue":"3","key":"5913_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.11394\/tjpnsec.12.61","volume":"12","author":"K Nakata","year":"2021","unstructured":"Nakata K, Sawaeda Y, Tsunoda Y, Sakakibara K, Nakamura M (2021) A hybrid optimization method mixing metaheuristics and mathematical programming techniques based on a mixed integer programming model. Trans Jpn Soc Evolut Comput 12(3):61\u201372. https:\/\/doi.org\/10.11394\/tjpnsec.12.61. (in Japanese)","journal-title":"Trans Jpn Soc Evolut Comput"},{"key":"5913_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume":"1520","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problem. Princ Pract Constr Program 1520:417\u2013431. https:\/\/doi.org\/10.1007\/3-540-49481-2_30","journal-title":"Princ Pract Constr Program"},{"key":"5913_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-011-9161-7","volume":"19","author":"M Caserta","year":"2013","unstructured":"Caserta M, Vo\u00df S (2013) A MIP-based framework and its application on a lot sizing problem with setup carryover. J Heurist 19:295\u2013316. https:\/\/doi.org\/10.1007\/s10732-011-9161-7","journal-title":"J Heurist"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05913-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-05913-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05913-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T10:41:02Z","timestamp":1717497662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-05913-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,10]]},"references-count":9,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["5913"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-05913-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,10]]},"assertion":[{"value":"10 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}