{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T02:22:46Z","timestamp":1778034166137,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,21]],"date-time":"2012-01-21T00:00:00Z","timestamp":1327104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10479-012-1059-8","type":"journal-article","created":{"date-parts":[[2012,1,20]],"date-time":"2012-01-20T11:03:29Z","timestamp":1327057409000},"page":"173-186","source":"Crossref","is-referenced-by-count":29,"title":["Makespan minimization for parallel machines scheduling with multiple availability constraints"],"prefix":"10.1007","volume":"213","author":[{"given":"Navid","family":"Hashemian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claver","family":"Diallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B\u00e9la","family":"Vizv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,21]]},"reference":[{"issue":"9","key":"1059_CR1","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1016\/S0167-8191(00)00035-1","volume":"26","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Drozdowski, M., Formanowicz, P., Kubiak, W., & Schmidt, G. (2000). Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing, 26(9), 1195\u20131211.","journal-title":"Parallel Computing"},{"key":"1059_CR2","first-page":"287","volume":"6","author":"R. Demir","year":"1995","unstructured":"Demir, R., & Vizv\u00e1ri, B. (1995). A\u00a0column generation algorithm to schedule identical parallel machines. Pure Mathematics and Applications, 6, 287\u2013299.","journal-title":"Pure Mathematics and Applications"},{"key":"1059_CR3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. Graham","year":"1969","unstructured":"Graham, R. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"1059_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawer, E., Lenstra, J., & Rinnooy Ken, A. (1979). Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"1059_CR5","unstructured":"Hashemian, N. (2010). Makespan minimization for parallel machines scheduling with availability constraints. Master\u2019s thesis, Dalhousie University."},{"key":"1059_CR6","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1002\/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D","volume":"42","author":"J. Ho","year":"1995","unstructured":"Ho, J., & Wong, J. (1995). Makespan minimization for m parallel identical processors. Naval Research Logistics, 42, 935\u2013948.","journal-title":"Naval Research Logistics"},{"key":"1059_CR7","first-page":"991","volume":"30","author":"H. Kellereer","year":"1998","unstructured":"Kellereer, H. (1998). Algorithms for multiprocessor scheduling with machine release times. IIE Transactions, 30, 991\u2013999.","journal-title":"IIE Transactions"},{"key":"1059_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C.-Y. Lee","year":"1991","unstructured":"Lee, C.-Y. (1991). Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics, 30, 53\u201361.","journal-title":"Discrete Applied Mathematics"},{"key":"1059_CR9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C.-Y. Lee","year":"1996","unstructured":"Lee, C.-Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395\u2013416.","journal-title":"Journal of Global Optimization"},{"key":"1059_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"C.-Y. Lee","year":"1997","unstructured":"Lee, C.-Y., Lei, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1\u201341.","journal-title":"Annals of Operations Research"},{"key":"1059_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.ejor.2003.08.034","volume":"160","author":"C. Liao","year":"2005","unstructured":"Liao, C., Shyur, D., & Lin, C. (2005). Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research, 160, 445\u2013456.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1059_CR12","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","volume":"184","author":"L.-W. Liao","year":"2008","unstructured":"Liao, L.-W., & Sheen, G.-J. (2008). Parallel machine scheduling with machine availability and eligibility constraints. European Journal of Operational Research, 184(2), 458\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"1059_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11766-997-0012-0","volume":"12","author":"G. Lin","year":"1997","unstructured":"Lin, G., He, Y., Yao, Y., & Lu, H. (1997). Exact bounds of the modified lpt algorithms applying to parallel machines scheduling with nonsimultaneous machine available times. Applied Mathematics. A Journal of Chinese Universities, 12, 109\u2013116.","journal-title":"Applied Mathematics. A Journal of Chinese Universities"},{"issue":"2","key":"1059_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y. Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A\u00a0survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199\u2013211.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"1059_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1\u201315.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1059-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1059-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1059-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:32Z","timestamp":1559153372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1059-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,21]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["1059"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1059-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,21]]}}}