{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T07:33:37Z","timestamp":1776584017062,"version":"3.51.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["POCI-01-0145-FEDER-031821"],"award-info":[{"award-number":["POCI-01-0145-FEDER-031821"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["POCI-01-0145-FEDER-031447"],"award-info":[{"award-number":["POCI-01-0145-FEDER-031447"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Islamic Azad University of Lenjan"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10898-021-00992-6","type":"journal-article","created":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T09:20:37Z","timestamp":1612516837000},"page":"463-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":120,"title":["Production and transport scheduling in flexible job shop manufacturing systems"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6833-9316","authenticated-orcid":false,"given":"Seyed Mahdi","family":"Homayouni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9402-2088","authenticated-orcid":false,"given":"Dalila B. M. M.","family":"Fontes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,5]]},"reference":[{"issue":"3","key":"992_CR1","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., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manag. Sci."},{"issue":"1","key":"992_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-016-2203-7","volume":"242","author":"HM Afsar","year":"2016","unstructured":"Afsar, H.M., Artigues, C., Bourreau, E., Kedad-Sidhoum, S.: Machine reassignment problem: the roadef\/euro challenge 2012. Ann. Oper. Res. 242(1), 1\u201317 (2016)","journal-title":"Ann. Oper. Res."},{"key":"992_CR3","doi-asserted-by":"publisher","first-page":"9270802","DOI":"10.1155\/2018\/9270802","volume":"2018","author":"MK Amjad","year":"2018","unstructured":"Amjad, M.K., Butt, S.I., Kousar, R., Ahmad, R., Agha, M.H., Faping, Z., Anjum, N., Asgher, U.: Recent research trends in genetic algorithm based flexible job shop scheduling problems. Math. Probl. Eng. 2018, 9270802 (2018)","journal-title":"Math. Probl. Eng."},{"issue":"4","key":"992_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri, A., Mostafa, Z., Iraj, M., Mehdi, Y.: An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener. Comput. Syst. 26(4), 533\u2013541 (2010)","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"992_CR5","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.: A time window approach to simultaneous scheduling of machines and material handling system in an fms. Oper. Res. 43(6), 1058\u20131070 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"992_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"key":"992_CR7","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT, Conference, Montreal, Canada (2008)"},{"issue":"1","key":"992_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"992_CR9","unstructured":"Chambers, J.B., Barnes, J.W.: Tabu search for the flexible-routing job shop problem. In: Graduate Program in Operations Research and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-10 (1996)"},{"issue":"3","key":"992_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"992_CR11","unstructured":"De Smet, G.: Optaplanner user guide. Red Hat and the community"},{"key":"992_CR12","doi-asserted-by":"crossref","unstructured":"Deroussi, L.: A hybrid pso applied to the flexible job shop with transport. In: International Conference on Swarm Intelligence Based Optimization, pp 115\u2013122. Springer (2014)","DOI":"10.1007\/978-3-319-12970-9_13"},{"key":"992_CR13","unstructured":"Deroussi, L., Norre, S.: Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: International Conference on Metaheuristics and Nature Inspired Computing, pp 1\u20132. Djerba Island Tunisia (2010)"},{"issue":"3","key":"992_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi, P., Saidi-Mehrabad, M., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3), 331\u2013342 (2007)","journal-title":"J. Intell. Manuf."},{"key":"992_CR15","unstructured":"Fisher, H., Thompson. G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)"},{"issue":"4","key":"992_CR16","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10898-018-0681-7","volume":"74","author":"DBMM Fontes","year":"2019","unstructured":"Fontes, D.B.M.M., Homayouni, S.M.: Joint production and transportation scheduling in flexible manufacturing systems. J. Glob. Optim. 74(4), 879\u2013908 (2019)","journal-title":"J. Glob. Optim."},{"key":"992_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of np-completeness, W. H. Freeman & Co. (1979)"},{"issue":"2","key":"992_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"992_CR19","unstructured":"LLC Gurobi\u00a0Optimization. Gurobi optimizer reference manual, (2018)"},{"issue":"1\u20134","key":"992_CR20","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00170-010-2820-2","volume":"53","author":"MVS Kumar","year":"2011","unstructured":"Kumar, M.V.S., Janardhana, R., Rao, C.S.P.: Simultaneous scheduling of machines and vehicles in an fms environment with alternative routing. Int. J. Adv. Manuf. Technol. 53(1\u20134), 339\u2013351 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"992_CR21","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)"},{"key":"992_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93\u2013110 (2016)","journal-title":"Int. J. Prod. Econ."},{"key":"992_CR23","doi-asserted-by":"crossref","unstructured":"Nouri, H.E., Driss, O.B., Gh\u00e9dira, K.: A classification schema for the job shop scheduling problem with transportation resources: state-of-the-art review. In: Artificial Intelligence Perspectives in Intelligent Systems, pp 1\u201311. Springer (2016)","DOI":"10.1007\/978-3-319-33625-1_1"},{"key":"992_CR24","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","volume":"102","author":"HE Nouri","year":"2016","unstructured":"Nouri, H.E., Driss, O.B., Gh\u00e9dira, K.: Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput. Ind. Eng. 102, 488\u2013501 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"992_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/trsc.10.2.149","volume":"10","author":"CS Orloff","year":"1976","unstructured":"Orloff, C.S.: Route constrained fleet scheduling. Transp. Sci. 10(2), 149\u2013168 (1976)","journal-title":"Transp. Sci."},{"issue":"5\u20136","key":"992_CR26","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s00170-005-0223-6","volume":"31","author":"BSP Reddy","year":"2006","unstructured":"Reddy, B.S.P., Rao, C.S.P.: A hybrid multi-objective ga for simultaneous scheduling of machines and agvs in fms. Int. J. Adv. Manuf. Technol. 31(5\u20136), 602\u2013613 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"992_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","volume":"265","author":"L Shen","year":"2018","unstructured":"Shen, L., Dauz\u00e8re-P\u00e9r\u00e8s, S., Neufeld, J.S.: Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2), 503\u2013516 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"992_CR28","first-page":"2015","volume":"29","author":"T Wauters","year":"2014","unstructured":"Wauters, T., Toffolo, T., Christiaens, J., Van Malderen, S.: The winning approach for the verolog solver challenge: the swap-body vehicle routing problem. Proc. ORBEL 29, 2015 (2014)","journal-title":"Proc. ORBEL"},{"issue":"7","key":"992_CR29","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q Zhang","year":"2012","unstructured":"Zhang, Q., Manier, H., Manier, M.-A.: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput. Oper. Res. 39(7), 1713\u20131723 (2012)","journal-title":"Comput. Oper. Res."},{"key":"992_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Manier, H., Manier, M.-A.: Metaheuristics for job shop scheduling with transportation, In: Jarboui, B., Siarry, P., Teghem, J. (eds.) Metaheuristics for Production Scheduling, Wiley (2013)","DOI":"10.1002\/9781118731598.ch17"},{"issue":"4","key":"992_CR31","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1080\/00207543.2013.828164","volume":"52","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Manier, H., Manier, M.-A.: A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints. Int. J. Prod. Res. 52(4), 985\u20131002 (2014)","journal-title":"Int. J. Prod. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-00992-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-021-00992-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-00992-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T18:28:34Z","timestamp":1614191314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-021-00992-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["992"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-00992-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2]]},"assertion":[{"value":"1 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}