{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:14:58Z","timestamp":1771024498153,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-015-9846-1","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T12:39:59Z","timestamp":1425040799000},"page":"967-981","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period"],"prefix":"10.1007","volume":"30","author":[{"given":"Dujuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunqiang","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanzhang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"key":"9846_CR1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I Adiri","year":"1989","unstructured":"Adiri I, Bruno J, Frostig E, Kan A (1989) Single-machine flow-time scheduling with a single breakdown. Acta Inform 26:679\u2013685","journal-title":"Acta Inform"},{"key":"9846_CR2","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/ijoc.1100.0396","volume":"23","author":"S Batun","year":"2011","unstructured":"Batun S, Denton BT, Huschka TR, Schaefer AJ (2011) Operating room pooling and parallel surgery processing under uncertainty. Informs J Comput 23:220\u2013237","journal-title":"Informs J Comput"},{"key":"9846_CR3","doi-asserted-by":"crossref","first-page":"2660","DOI":"10.1016\/j.cor.2008.11.012","volume":"36","author":"B Cardoen","year":"2009","unstructured":"Cardoen B, Demeulemeester E, Belien J (2009a) Sequencing surgical cases in a day-care environment: an exact branch-and-price approach. Comput Oper Res 36:2660\u20132669","journal-title":"Comput Oper Res"},{"key":"9846_CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ijpe.2009.03.009","volume":"119","author":"B Cardoen","year":"2009","unstructured":"Cardoen B, Demeulemeester E, Belien J (2009b) Optimizing a multiple objective surgical case sequencing problem. Int J Prod Econ 119:354\u2013366","journal-title":"Int J Prod Econ"},{"key":"9846_CR5","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","volume":"201","author":"B Cardoen","year":"2010","unstructured":"Cardoen B, Demeulemeester E, Belien J (2010) Operating room planning and scheduling: a literature review. Eur J Oper Res 201:921\u2013932","journal-title":"Eur J Oper Res"},{"key":"9846_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M Crepinsek","year":"2013","unstructured":"Crepinsek M, Liu S, Mernik M (2013) Exploration and exploitation in evolutionary algorithms. ACM Comput Surv 45:1\u201333","journal-title":"ACM Comput Surv"},{"key":"9846_CR7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T Evol Comput 6:182\u2013197","journal-title":"IEEE T Evol Comput"},{"key":"9846_CR8","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1080\/00207721.2013.822126","volume":"46","author":"Y He","year":"2015","unstructured":"He Y, Sun L (2015) One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations. Int J Syst Sci 46:1319\u20131326","journal-title":"Int J Syst Sci"},{"key":"9846_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10878-012-9521-8","volume":"27","author":"G Jaradat","year":"2014","unstructured":"Jaradat G, Ayob M, Ahmad Z (2014) On the performance of Scatter Search for post-enrolment course timetabling problems. J Comb Optim 27:417\u2013439","journal-title":"J Comb Optim"},{"key":"9846_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ijpe.2004.12.006","volume":"99","author":"A Jebali","year":"2006","unstructured":"Jebali A, Hadj Alouane AB, Ladet P (2006) Operating rooms scheduling. Int J Prod Econ 99:52\u201362","journal-title":"Int J Prod Econ"},{"key":"9846_CR11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10878-011-9415-1","volume":"26","author":"M Ji","year":"2013","unstructured":"Ji M, Hsu C, Yang D (2013) Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration. J Comb Optim 26:437\u2013447","journal-title":"J Comb Optim"},{"key":"9846_CR12","first-page":"417","volume":"27","author":"I Kacem","year":"2013","unstructured":"Kacem I, Kellerer H, Lanuel Y (2013) Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J Comb Optim 27:417\u2013439. doi: 10.1007\/s10878-013-9643-7","journal-title":"J Comb Optim"},{"key":"9846_CR13","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/S0377-2217(00)00322-2","volume":"135","author":"CY Lee","year":"2001","unstructured":"Lee CY, Lin CS (2001) Single-machine scheduling with maintenance and repair rate-modifying activities. Eur J Oper Res 135:493\u2013513","journal-title":"Eur J Oper Res"},{"key":"9846_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/TEVC.2009.2027359","volume":"14","author":"D Lim","year":"2010","unstructured":"Lim D, Jin YC, Ong YS, Sendhoff B (2010) Generalizing surrogate-assisted evolutionary computation. IEEE Trans Evol Comput 14:329\u2013355","journal-title":"IEEE Trans Evol Comput"},{"key":"9846_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","volume":"222","author":"Q Pan","year":"2012","unstructured":"Pan Q, Ruiz R (2012) Local search methods for the flowshop scheduling problem with flowtime minimization. Eur J Oper Res 222:31\u201343","journal-title":"Eur J Oper Res"},{"key":"9846_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10878-006-9015-7","volume":"13","author":"AR Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13:79\u2013102","journal-title":"J Comb Optim"},{"key":"9846_CR17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"RG Vickson","year":"1980","unstructured":"Vickson RG (1980) Two single machine sequencing problems involving controllable job processing times. AIIE Trans 12:258\u2013262","journal-title":"AIIE Trans"},{"key":"9846_CR18","doi-asserted-by":"crossref","unstructured":"Yu S (2014) An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities. J Comb Optim. doi: 10.1007\/s10878-014-9739-8","DOI":"10.1007\/s10878-014-9739-8"},{"key":"9846_CR19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10878-012-9535-2","volume":"27","author":"L Zhong","year":"2014","unstructured":"Zhong L, Luo S, Wu L, Xu L, Yang J, Tang G (2014) A two-stage approach for surgery scheduling. J Comb Optim 27:545\u2013556","journal-title":"J Comb Optim"},{"key":"9846_CR20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TCYB.2013.2245892","volume":"44","author":"A Zhou","year":"2014","unstructured":"Zhou A, Jin YC, Zhang Q (2014) A population prediction strategy for evolutionary dynamic multiobjective optimization. IEEE Trans Cybern 44:40\u201353","journal-title":"IEEE Trans Cybern"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9846-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9846-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9846-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:25Z","timestamp":1559276605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9846-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9846"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9846-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,28]]}}}