{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:55:44Z","timestamp":1768006544080,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T00:00:00Z","timestamp":1658966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00885-8","type":"journal-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T13:17:10Z","timestamp":1659014230000},"page":"1284-1322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Job-shop scheduling-joint consideration of production, transport, and storage\/retrieval systems"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9402-2088","authenticated-orcid":false,"given":"Dalila B. M. M.","family":"Fontes","sequence":"first","affiliation":[]},{"given":"S. Mahdi","family":"Homayouni","sequence":"additional","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,28]]},"reference":[{"issue":"17","key":"885_CR1","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1080\/00207543.2013.813984","volume":"51","author":"A Alonso-Ayuso","year":"2013","unstructured":"Alonso-Ayuso A, Tirado G, Ud\u00edas \u00c1 (2013) On a selection and scheduling problem in automatic storage and retrieval warehouses. Int J Prod Res 51(17):5337\u20135353","journal-title":"Int J Prod Res"},{"issue":"4","key":"885_CR2","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1287\/trsc.2018.0873","volume":"53","author":"K Azadeh","year":"2019","unstructured":"Azadeh K, De Koster R, Roy D (2019) Robotized and automated warehouse systems: Review and recent developments. Transp Sci 53(4):917\u2013945","journal-title":"Transp Sci"},{"issue":"6","key":"885_CR3","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","volume":"43","author":"\u00dc Bilge","year":"1995","unstructured":"Bilge \u00dc, Ulusoy G (1995) A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper Res 43(6):1058\u20131070","journal-title":"Oper Res"},{"issue":"3","key":"885_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.ejor.2016.04.008","volume":"254","author":"N Boysen","year":"2016","unstructured":"Boysen N (2016) Stephan K A survey on single crane scheduling in automated storage\/retrieval systems. Eur J Oper Res 254(3):691\u2013704","journal-title":"Eur J Oper Res"},{"issue":"1","key":"885_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke EK, Bykov Y (2017) The late acceptance hill-climbing heuristic. Eur J Oper Res 258(1):70\u201378","journal-title":"Eur J Oper Res"},{"issue":"11\u201312","key":"885_CR6","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1007\/s00170-003-1629-7","volume":"22","author":"KOV Chetty","year":"2003","unstructured":"Chetty KOV, Reddy SM (2003) Genetic algorithms for studies on AS\/RS integrated with machines. The International Journal of Advanced Manufacturing Technology 22(11\u201312):932\u2013940","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"885_CR7","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1080\/00207543.2015.1090032","volume":"54","author":"M Fathi","year":"2016","unstructured":"Fathi M, Rodr\u00edguez V, Fontes DBMM, Alvarez MJ (2016) A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines. Int J Prod Res 54(3):878\u2013893","journal-title":"Int J Prod Res"},{"issue":"4","key":"885_CR8","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10898-018-0681-7","volume":"74","author":"DBMM Fontes","year":"2019","unstructured":"Fontes DBMM, Homayouni SM (2019) Joint production and transportation scheduling in flexible manufacturing systems. J Global Optim 74(4):879\u2013908","journal-title":"J Global Optim"},{"issue":"24","key":"885_CR9","doi-asserted-by":"publisher","first-page":"7110","DOI":"10.1080\/00207543.2011.633234","volume":"50","author":"J-P Gagliardi","year":"2012","unstructured":"Gagliardi J-P, Renaud J (2012) Ruiz A Models for automated storage and retrieval systems: a literature review. Int J Prod Res 50(24):7110\u20137125","journal-title":"Int J Prod Res"},{"issue":"3","key":"885_CR10","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/s10878-019-00407-z","volume":"38","author":"Y Gao","year":"2019","unstructured":"Gao Y, Yuan J (2019) Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. J Comb Optim 38(3):698\u2013711","journal-title":"J Comb Optim"},{"key":"885_CR11","unstructured":"Gnanavelbabu A, Jerald J, Noorul\u00a0Haq A, Asokan P (2009) Multi objective scheduling of jobs, AGVs and AS\/RS in FMS using artificial immune system. In: Proceedings of National Conference on Emerging Trends in Engineering and Sciences, pp. 229\u2013239"},{"issue":"1","key":"885_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s10878-018-0294-6","volume":"36","author":"J Gu","year":"2018","unstructured":"Gu J, Gu M, Lu X, Zhang Y (2018) Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan. J Comb Optim 36(1):142\u2013161","journal-title":"J Comb Optim"},{"issue":"3","key":"885_CR13","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/00207543.2019.1709671","volume":"59","author":"A Ham","year":"2021","unstructured":"Ham A (2021) Transfer-robot task scheduling in job shop. Int J Prod Res 59(3):813\u2013823","journal-title":"Int J Prod Res"},{"key":"885_CR14","doi-asserted-by":"crossref","unstructured":"Homayouni SM, Fontes DBMM, Gon\u00e7alves JF (2020) A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. International Transactions in Operational Research","DOI":"10.1111\/itor.12878"},{"issue":"2","key":"885_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10898-021-00992-6","volume":"79","author":"SM Homayouni","year":"2021","unstructured":"Homayouni SM, Fontes DBMM (2021) Production and transport scheduling in flexible job shop manufacturing systems. J Global Optim 79(2):463\u2013502","journal-title":"J Global Optim"},{"issue":"2","key":"885_CR16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01322220","volume":"14","author":"N Jawahar","year":"1998","unstructured":"Jawahar N, Aravindan P, Ponnambalam SG (1998) Optimal random storage allocation for an AS\/RS in an FMS. The International Journal of Advanced Manufacturing Technology 14(2):116\u2013132","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"885_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10878-014-9727-z","volume":"30","author":"Y Jiang","year":"2015","unstructured":"Jiang Y, Zhang Q, Hu J, Dong J, Ji M (2015) Single-server parallel-machine scheduling with loading and unloading times. J Comb Optim 30(2):201\u2013213","journal-title":"J Comb Optim"},{"issue":"1","key":"885_CR18","first-page":"1","volume":"19","author":"M Kazemi","year":"2021","unstructured":"Kazemi M, Asef-Vaziri A, Shojaei T, Amiri S (2021) A math-heuristic algorithm for concurrent assignment and sequence scheduling in multi-shuttle shared location automated storage and retrieval systems. Journal of Supply Chain and Operations Management 19(1):1","journal-title":"Journal of Supply Chain and Operations Management"},{"issue":"4598","key":"885_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt DC, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"885_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","volume":"66","author":"J Kuhpfahl","year":"2016","unstructured":"Kuhpfahl J, Bierwirth C (2016) A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Computers & Operations Research 66:44\u201357","journal-title":"Computers & Operations Research"},{"issue":"4","key":"885_CR21","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1080\/00207543.2013.848040","volume":"52","author":"Y Kung","year":"2014","unstructured":"Kung Y, Kobayashi Y, Higashi T, Sugi M, Ota J (2014) Order scheduling of multiple stacker cranes on common rails in an automated storage\/retrieval system. Int J Prod Res 52(4):1171\u20131187","journal-title":"Int J Prod Res"},{"key":"885_CR22","volume-title":"Resouce constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement)","author":"S Lawrence","year":"1984","unstructured":"Lawrence S (1984) Resouce constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Carnegie-Mellon University, Graduate School of Industrial Administration"},{"issue":"2","key":"885_CR23","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10845-018-1459-y","volume":"31","author":"Z Li","year":"2020","unstructured":"Li Z, Barenji AV, Jiang J, Zhong RY, Xu G (2020) A mechanism for scheduling multi robot intelligent warehouse system face with dynamic demand. J Intell Manuf 31(2):469\u2013480","journal-title":"J Intell Manuf"},{"key":"885_CR24","doi-asserted-by":"crossref","unstructured":"Li Y, Wang J, Liu Z (2021) A simple two-agent system for multi-objective flexible job-shop scheduling. Journal of Combinatorial Optimization, 1\u201323","DOI":"10.1007\/s10878-021-00748-8"},{"issue":"2","key":"885_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.23919\/CSMS.2021.0013","volume":"1","author":"L Luo","year":"2021","unstructured":"Luo L, Zhao N, Lodewijks G (2021) Scheduling storage process of shuttle-based storage and retrieval systems based on reinforcement learning. Complex System Modeling and Simulation 1(2):131\u2013144","journal-title":"Complex System Modeling and Simulation"},{"key":"885_CR26","unstructured":"Makino (2020) Crowning Achievement, automation helps Prince industries master global manufacturing. https:\/\/www.competitiveproduction.com\/articles\/crowning-achievement\/(Accessed: 03.07.2020)"},{"issue":"1","key":"885_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1013337324030","volume":"6","author":"M Randall","year":"2002","unstructured":"Randall M, McMahon G, Sugden S (2002) A simulated annealing approach to communication network design. J Comb Optim 6(1):55\u201365","journal-title":"J Comb Optim"},{"issue":"5\u20136","key":"885_CR28","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s00170-005-0223-6","volume":"31","author":"BSP Reddy","year":"2006","unstructured":"Reddy BSP, Rao CSP (2006) A hybrid multi-objective ga for simultaneous scheduling of machines and agvs in fms. The International Journal of Advanced Manufacturing Technology 31(5\u20136):602\u2013613","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"885_CR29","unstructured":"ReliablePlanet (2020) Mazda capitalizes on flexible manufacturing capabilities. https:\/\/www.reliableplant.com\/Read\/7750\/mazda(Accessed: 03.07.2020)"},{"issue":"2","key":"885_CR30","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ejor.2008.01.038","volume":"194","author":"KJ Roodbergen","year":"2009","unstructured":"Roodbergen KJ, Vis IF (2009) A survey of literature on automated storage and retrieval systems. Eur J Oper Res 194(2):343\u2013362","journal-title":"Eur J Oper Res"},{"issue":"3","key":"885_CR31","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/s10878-020-00607-y","volume":"40","author":"N Sekkal","year":"2020","unstructured":"Sekkal N, Belkaid F (2020) A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints. J Comb Optim 40(3):660\u2013696","journal-title":"J Comb Optim"},{"key":"885_CR32","doi-asserted-by":"crossref","unstructured":"Song J, Yang M, Zhou X (2020) Scheduling optimization of automated storage and retrieval system based on four-way shuttles. In: 2020 IEEE International Conference on Mechatronics and Automation (ICMA), pp. 524\u2013529 . IEEE","DOI":"10.1109\/ICMA49215.2020.9233686"},{"key":"885_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.120409","volume":"257","author":"HH Tostani","year":"2020","unstructured":"Tostani HH, Haleh H, Molana HSM, Sobhani FM (2020) A bi-level bi-objective optimization model for the integrated storage classes and dual shuttle cranes scheduling in AS\/RS with energy consumption, workload balance and time windows. J Clean Prod 257:120409","journal-title":"J Clean Prod"},{"issue":"4","key":"885_CR34","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"J Zhang","year":"2019","unstructured":"Zhang J, Ding G, Zou Y, Qin S, Fu J (2019) Review of job shop scheduling research and its new perspectives under industry 4.0. J Intell Manuf 30(4):1809\u20131830","journal-title":"J Intell Manuf"},{"key":"885_CR35","doi-asserted-by":"crossref","unstructured":"Zhang X, Lin W-C, Wu C-C (2021) Rescheduling problems with allowing for the unexpected new jobs arrival. Journal of Combinatorial Optimization, 1\u201316","DOI":"10.1007\/s10878-021-00803-4"},{"key":"885_CR36","doi-asserted-by":"crossref","unstructured":"Zhang S, Nip K, Wang Z (2020) Related machine scheduling with machine speeds satisfying linear constraints. Journal of Combinatorial Optimization, 1\u201317","DOI":"10.1007\/s10878-020-00523-1"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00885-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00885-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00885-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:20:33Z","timestamp":1660371633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00885-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,28]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["885"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00885-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,28]]},"assertion":[{"value":"7 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","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 have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the programming codes are available upon request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code available"}}]}}