{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:25:19Z","timestamp":1773617119226,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10586-018-02892-z","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T17:10:34Z","timestamp":1548695434000},"page":"1007-1015","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal interval scheduling with nonidentical given machines"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8743-7736","authenticated-orcid":false,"given":"Haohao","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanghan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"issue":"5","key":"2892_CR1","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AWJ Kolen","year":"2007","unstructured":"Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: a survey. Naval Res. Logist. 54(5), 530\u2013543 (2007)","journal-title":"Naval Res. Logist."},{"issue":"1","key":"2892_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0377-2217(94)90150-3","volume":"73","author":"K Jansen","year":"1994","unstructured":"Jansen, K.: An approximation algorithm for the license and shift class design problem. Eur. J. Oper. Res. 73(1), 127\u2013131 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2892_CR3","first-page":"624","volume":"82","author":"LG Kroon","year":"1995","unstructured":"Kroon, L.G., Salomon, M., Van Wassenhove, L.N.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Eur. J. Oper. Res. 82(4), 624\u2013638 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"2892_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_226","volume-title":"Approximation Results for the Optimum Cost Chromatic Partition Problem","author":"K Jansen","year":"1997","unstructured":"Jansen, K.: Approximation Results for the Optimum Cost Chromatic Partition Problem. Springer, Berlin, Heidelberg (1997)"},{"key":"2892_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"RH Mhring","year":"1980","unstructured":"Mhring, R.H.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Cambridge (1980)"},{"issue":"1","key":"2892_CR6","first-page":"193","volume":"2719","author":"R Bhatia","year":"2002","unstructured":"Bhatia, R., Chuzhoy, J., Freund, A., Naor, J.S.: Algorithmic aspects of bandwidth trading. ASM Trans. Algorithms 2719(1), 193\u2013193 (2002)","journal-title":"ASM Trans. Algorithms"},{"key":"2892_CR7","doi-asserted-by":"crossref","unstructured":"Huang, Q., Lloyd, E.: Cost constrained fixed job scheduling. In: Lecture Notes in Computer Science, vol. 2841, pp. 111\u2013124 (2003)","DOI":"10.1007\/978-3-540-45208-9_10"},{"issue":"3","key":"2892_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.cor.2014.06.002","volume":"51","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Bianchessi, N., Filippi, C.: Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51(3), 268\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"2892_CR9","doi-asserted-by":"publisher","first-page":"1836","DOI":"10.1016\/j.cor.2011.03.001","volume":"38","author":"SO Krumke","year":"2011","unstructured":"Krumke, S.O., Thielen, C., Westphal, S.: Interval scheduling on related machines. Comput. Oper. Res. 38(12), 1836\u20131844 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2892_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00224-013-9528-2","volume":"55","author":"SPY Fung","year":"2012","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.: Improved randomized online scheduling of intervals and jobs. Theory Comput. Syst. 55(1), 202\u2013228 (2012)","journal-title":"Theory Comput. Syst."},{"key":"2892_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.cie.2015.12.021","volume":"93","author":"M Branda","year":"2015","unstructured":"Branda, M., Novotn, J., Olstad, A.: Fixed interval scheduling under uncertainty a tabu search algorithm for an extended robust coloring formulation. Comput. Ind. Eng. 93, 45\u201354 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"29","key":"2892_CR12","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E Angelelli","year":"2011","unstructured":"Angelelli, E., Filippi, C.: On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412(29), 3650\u20133657 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"C","key":"2892_CR13","first-page":"227","volume":"562","author":"A Gavruskin","year":"2014","unstructured":"Gavruskin, A., Khoussainov, B., Kokho, M., Liu, J.: Dynamic algorithms for monotonic interval scheduling problem. Theor. Comput. Sci. 562(C), 227\u2013242 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2892_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M.Y., Ng, C.T., Edwin Cheng, T.C.: Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2), 331\u2013342 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2892_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-02892-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-02892-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-02892-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T19:14:38Z","timestamp":1580152478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-02892-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2892"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-02892-z","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"17 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}