{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T02:16:08Z","timestamp":1767665768029,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Fundation of China","award":["61773192"],"award-info":[{"award-number":["61773192"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10489-020-01975-y","type":"journal-article","created":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T01:02:35Z","timestamp":1606093355000},"page":"3936-3951","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An imperialist competition algorithm using a global search strategy for physical examination scheduling"],"prefix":"10.1007","volume":"51","author":[{"given":"Hui","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3617-6708","authenticated-orcid":false,"given":"Jun-qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lijing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,23]]},"reference":[{"issue":"2","key":"1975_CR1","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2017.06.051","volume":"264","author":"RL Burdett","year":"2018","unstructured":"Burdett RL, Kozan E (2018) An integrated approach for scheduling health care activities in a hospital. Eur J Oper Res 264(2):756\u2013773","journal-title":"Eur J Oper Res"},{"issue":"9","key":"1975_CR2","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/07408170802165880","volume":"40","author":"D Gupta","year":"2008","unstructured":"Gupta D, Denton B (2008) Appointment scheduling in health care: challenges and opportunities. IIE Trans 40(9):800\u2013819","journal-title":"IIE Trans"},{"key":"1975_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.cie.2015.04.010","volume":"85","author":"W Xiang","year":"2015","unstructured":"Xiang W, Yin J, Lim G (2015) An ant colony optimization approach for solving an operating room surgery scheduling problem. Comput Ind Eng 85:335\u2013345","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1975_CR4","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1007\/s10489-017-0935-y","volume":"47","author":"FS Hsieh","year":"2017","unstructured":"Hsieh FS (2017) A hybrid and scalable multi-agent approach for patient scheduling based on Petri net models. Appl Intell 47(4):1068\u20131086","journal-title":"Appl Intell"},{"issue":"2","key":"1975_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10489-017-0908-1","volume":"47","author":"D Quintana","year":"2017","unstructured":"Quintana D, Cervantes A, Saez Y, Isasi P (2017) Clustering technique for large-scale home care crew scheduling problems. Appl Intell 47(2):443\u2013455","journal-title":"Appl Intell"},{"issue":"3","key":"1975_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"MN Azaiez","year":"2005","unstructured":"Azaiez MN, Al-Sharif SS (2005) A 0-1 goal programming model for nurse scheduling. Comput Operat Res 32(3):491\u2013507","journal-title":"Comput Operat Res"},{"issue":"3","key":"1975_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.ejor.2006.03.059","volume":"185","author":"DN Pham","year":"2008","unstructured":"Pham DN, Klinkert A (2008) Surgical case scheduling as a generalized job shop scheduling problem. Eur J Oper Res 185(3):1011\u20131025","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1975_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/TASE.2012.2207453","volume":"9","author":"H Zhu","year":"2012","unstructured":"Zhu H, Hou M, Wang C, Zhou M (2012) An efficient outpatient scheduling approach. IEEE Trans Automat Sci Eng 9(4):701\u2013709","journal-title":"IEEE Trans Automat Sci Eng"},{"key":"1975_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ijpe.2014.08.002","volume":"158","author":"P Cappanera","year":"2014","unstructured":"Cappanera P, Visintin F, Banditori C (2014) Comparing resource balancing criteria in master surgical scheduling: a combined optimisation-simulation approach. Int J Prod Econ 158:179\u2013196","journal-title":"Int J Prod Econ"},{"issue":"3","key":"1975_CR10","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ejor.2013.08.026","volume":"233","author":"D Gartner","year":"2014","unstructured":"Gartner D, Kolisch R (2014) Scheduling the hospital-wide flow of elective patients. Eur J Oper Res 233(3):689\u2013699","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1975_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2016.06.064","volume":"258","author":"A Ahmadi-Javid","year":"2017","unstructured":"Ahmadi-Javid A, Jalali Z, Klassen KJ (2017) Outpatient appointment systems in healthcare: a review of optimization studies. Eur J Oper Res 258(1):3\u201334","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1975_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.06.037","volume":"265","author":"M Erhard","year":"2018","unstructured":"Erhard M, Schoenfelder J, F\u00fcgener A, Brunner JO (2018) State of the art in physician scheduling. Eur J Oper Res 265(1):1\u201318","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1975_CR13","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2018.05.017","volume":"281","author":"Y Jiang","year":"2020","unstructured":"Jiang Y, Abouee-Mehrizi H, Diao Y (2020) Data-driven analytics to support scheduling of multi-priority multi-class patients with wait time targets. Eur J Oper Res 281(3):597\u2013611","journal-title":"Eur J Oper Res"},{"key":"1975_CR14","doi-asserted-by":"publisher","first-page":"100600","DOI":"10.1016\/j.swevo.2019.100600","volume":"52","author":"JQ Li","year":"2020","unstructured":"Li JQ, Tao XR, Jia BX, Han YY, Liu C, Duan P, Sang HY (2020) Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots. Swarm Evol Comput 52:100600. https:\/\/doi.org\/10.1016\/j.swevo.2019.100600","journal-title":"Swarm Evol Comput"},{"key":"1975_CR15","doi-asserted-by":"publisher","unstructured":"Li JQ, Han YQ, Duan PY, Han YY, Niu B, Li CD, Zheng ZX, Liu YP (2020) Meta-heuristic algorithm for solving vehicle routing problems with time windows and synchronized visit constraints in prefabricated systems. J Clean Prod 2020. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119464","DOI":"10.1016\/j.jclepro.2019.119464"},{"issue":"4","key":"1975_CR16","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, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Futur Gener Comput Syst 26(4):533\u2013541","journal-title":"Futur Gener Comput Syst"},{"key":"1975_CR17","doi-asserted-by":"crossref","unstructured":"Yin J, Xiang W (2012) Ant colony algorithm for surgery scheduling problem. In: International conference in swarm intelligence. Springer, pp 198\u2013205","DOI":"10.1007\/978-3-642-30976-2_24"},{"issue":"12","key":"1975_CR18","doi-asserted-by":"publisher","first-page":"15447","DOI":"10.1016\/j.eswa.2011.06.016","volume":"38","author":"MC Su","year":"2011","unstructured":"Su MC, Lai SC, Wang PC, Hsieh YZ, Lin SC (2011) A SOMO-based approach to the operating room scheduling problem. Expert Syst Appl 38(12):15447\u201315454","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1975_CR19","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2014.03.043","volume":"238","author":"S Lee","year":"2014","unstructured":"Lee S, Yih Y (2014) Reducing patient-flow delays in surgical suites through determining start-times of surgical cases. Eur J Oper Res 238(2):620\u2013629","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1975_CR20","first-page":"1824","volume":"26","author":"R Behmanesh","year":"2019","unstructured":"Behmanesh R, Zandieh M, Molana SH (2019) The surgical case scheduling problem with fuzzy duration time: an ant system algorithm. Scientia Iranica. Transaction E Ind Eng 26(3):1824\u20131841","journal-title":"Scientia Iranica. Transaction E Ind Eng"},{"key":"1975_CR21","doi-asserted-by":"publisher","first-page":"104913","DOI":"10.1016\/j.knosys.2019.104913","volume":"186","author":"R Behmanesh","year":"2019","unstructured":"Behmanesh R, Zandieh M (2019) Surgical case scheduling problem with fuzzy surgery time: an advanced bi-objective ant system approach. Knowl-Based Syst 186:104913","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"1975_CR22","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ejor.2016.05.039","volume":"255","author":"R Luscombe","year":"2016","unstructured":"Luscombe R, Kozan E (2016) Dynamic resource allocation to improve emergency department efficiency in real time. Eur J Oper Res 255(2):593\u2013603","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1975_CR23","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s10845-009-0373-8","volume":"22","author":"HS Mirsanei","year":"2011","unstructured":"Mirsanei HS, Zandieh M, Moayed MJ, Khabbazi MR (2011) A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. J Intell Manuf 22(6):965\u2013978","journal-title":"J Intell Manuf"},{"issue":"6","key":"1975_CR24","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei V, Naderi B, Jolai F, Khalili M (2009) A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Futur Gener Comput Syst 25(6):654\u2013661","journal-title":"Futur Gener Comput Syst"},{"issue":"5-6","key":"1975_CR25","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Tech 32(5-6):563\u2013570","journal-title":"Int J Adv Manuf Tech"},{"issue":"3","key":"1975_CR26","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European J Oper Res 177(3):2033\u20132049","journal-title":"European J Oper Res"},{"key":"1975_CR27","doi-asserted-by":"crossref","unstructured":"Pandey S, Wu L, Guru SM, Buyya R (2010) A particle swarm optimization-based heuristic for scheduling workflowapplications in cloud computing environments. In: 2010 24th IEEE international conference on advanced information networking and applications. IEEE, pp 400\u2013407","DOI":"10.1109\/AINA.2010.31"},{"key":"1975_CR28","doi-asserted-by":"publisher","unstructured":"Li JQ, Han YQ (2019) A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system. Clust Comput, pp 1\u201317. https:\/\/doi.org\/10.1007\/s10586-019-03022-z","DOI":"10.1007\/s10586-019-03022-z"},{"key":"1975_CR29","doi-asserted-by":"publisher","unstructured":"Li JQ, Deng JW, Li CY, Han YY, Tian J, Zhang B, Wang CG (2020) An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times. Knowledge-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2020.106032","DOI":"10.1016\/j.knosys.2020.106032"},{"key":"1975_CR30","doi-asserted-by":"publisher","unstructured":"Li JQ, Liu ZM, Li C, Zheng Z (2020) Improved artificial immune system algorithm for Type-2 fuzzy flexible job shop scheduling problem. IEEE Trans Fuzzy Syst 2020. https:\/\/doi.org\/10.1109\/TFUZZ.2020.3016225","DOI":"10.1109\/TFUZZ.2020.3016225"},{"key":"1975_CR31","doi-asserted-by":"publisher","unstructured":"Tao XR, Li JQ, Huang TH, Duan P (2020) Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption. Complex Intel Syst 2020. https:\/\/doi.org\/10.1007\/s40747-020-00193-w","DOI":"10.1007\/s40747-020-00193-w"},{"issue":"4","key":"1975_CR32","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38(4):3563\u20133573","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1975_CR33","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.cie.2004.12.008","volume":"48","author":"M Watanabe","year":"2005","unstructured":"Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput Indust Eng 48(4):743\u2013752","journal-title":"Comput Indust Eng"},{"key":"1975_CR34","doi-asserted-by":"crossref","unstructured":"Lee KM, Yamakawa T, Lee KM (1998) A genetic algorithm for general machine scheduling problems. In: 1998 second international conference. Knowledge-based intelligent electronic systems. Proceedings KES\u201998 (Cat. No. 98EX111), vol 2, pp 60\u201366","DOI":"10.1109\/KES.1998.725893"},{"key":"1975_CR35","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2005","unstructured":"Montgomery DC (2005) Design and analysis of experiments. Wiley, New York"},{"key":"1975_CR36","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","volume":"41","author":"S Karimi","year":"2017","unstructured":"Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Appl Math Model 41:667\u2013682","journal-title":"Appl Math Model"},{"key":"1975_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai M, Tang D, Giret A, Salido MA (2019) Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot Comput Integr Manuf 59:143\u2013157","journal-title":"Robot Comput Integr Manuf"},{"issue":"2","key":"1975_CR38","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.omega.2012.03.006","volume":"41","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC (2013) Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41(2):383\u2013389","journal-title":"Omega"},{"issue":"1","key":"1975_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/s10033-019-0337-7","volume":"32","author":"G Al Aqel","year":"2019","unstructured":"Al Aqel G, Li X, Gao L (2019) A modified iterated greedy algorithm for flexible job shop scheduling problem. Chin J Mech Eng 32(1):21","journal-title":"Chin J Mech Eng"},{"key":"1975_CR40","unstructured":"Li J, Du Y, Gao K, Duan P, Gong D, Pan Q, Suganthan P (2020) A hybrid iterated greedy algorithm for a crane transportation flexible job shop problem. IEEE Trans Automat Sci Eng, pp 1\u201318. In press"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01975-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T07:00:17Z","timestamp":1744182017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01975-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,23]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1975"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01975-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2020,11,23]]},"assertion":[{"value":"24 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}