{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:46:42Z","timestamp":1743151602261,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_42","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"563-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm Based on the Multi List Scheduling Model"],"prefix":"10.1007","author":[{"given":"Debasis","family":"Dwibedy","sequence":"first","affiliation":[]},{"given":"Rakesh","family":"Mohanty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Albers S (2009) Online scheduling. In: Robert Y, Vivien F (eds) Introduction to scheduling. Chapman and Hall\/CRC Press, pp 57\u201384","DOI":"10.1201\/9781420072747-c3"},{"key":"42_CR2","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S Albers","year":"2003","unstructured":"Albers S (2003) Online algorithms: a survey. Math Program 97(1):3\u201326","journal-title":"Math Program"},{"key":"42_CR4","unstructured":"Albers S (1997) Competitive online algorithms. OPTIMA: Math Program Soc Newsl 54(1):1\u20138"},{"issue":"1","key":"42_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/35043.35047","volume":"31","author":"J Kay","year":"1988","unstructured":"Kay J, Lauder P (1988) A fair share scheduler. Commun ACM 31(1):44\u201355","journal-title":"Commun ACM"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362","DOI":"10.1016\/S0167-5060(08)70743-X"},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(1):202\u2013208","journal-title":"Commun ACM"},{"key":"42_CR8","unstructured":"Brucker P (2006) Scheduling algorithms, 5th edn. Springer"},{"key":"42_CR9","unstructured":"Feitelson DG (1997) Job scheduling in multi-programmed parallel systems(Extended Version). IBM research report, RC 19790 (87657), Second Revision"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Tech J 45(1):1563\u20131581","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Bartal Y, Fiat A, Karloff H, Vohra R (1992) New algorithms for an ancient scheduling problem. In: Proceedings of the 24th ACM symposium on the theory of computing (STOC), Victoria, Canada, pp 51\u201358","DOI":"10.1145\/129712.129718"},{"issue":"2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G Galambos","year":"1993","unstructured":"Galambos G, Woeginger GJ (1993) An online scheduling heuristic with better worst-case Ratio than Graham\u2019s list scheduling. SIAM J Comput 22(2):349\u2013355","journal-title":"SIAM J Comput"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Karger DR, Phillips SJ, Torng E (1996) A better algorithm for an ancient scheduling problem. J Algorithm 20, article no:19:400\u2013430","DOI":"10.1006\/jagm.1996.0019"},{"issue":"1","key":"42_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y Bartal","year":"1994","unstructured":"Bartal Y, Karloff H, Rabani Y (1994) A better lower bound for online scheduling. Inf Process Lett. 50(1):113\u2013116","journal-title":"Inf Process Lett."},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B Chen","year":"1994","unstructured":"Chen B, Vliet AV, Woeginger GJ (1994) New lower and upper bound for online scheduling. Oper Res Lett 16(1):221\u2013230","journal-title":"Oper Res Lett"},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers S (1999) Better bounds for online scheduling. SIAM J Comput 29(1):459\u2013473","journal-title":"SIAM J Comput"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer R, Wahl M (2000) Online scheduling revisited. J Sched 3(1):343\u2013353","journal-title":"J Sched"},{"key":"42_CR19","unstructured":"Rudin III JF (2001) Improved bounds for the online scheduling problem, PhD thesis. The University of Texas at Dallas, May"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Englert M, Ozmen D, Westermann M (2008) The power of reordering for online minimum makespan scheduling. In: Proceedings of the 49th annual IEEE symposium on foundations of computer science (FOCS)","DOI":"10.1109\/FOCS.2008.46"},{"issue":"1","key":"42_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"S Seiden","year":"2000","unstructured":"Seiden S, Sgall J, Woeginger G (2000) Semi-online scheduling with decreasing job sizes. Oper Res Lett 27(1):215\u2013221","journal-title":"Oper Res Lett"},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.orl.2012.05.009","volume":"40","author":"TCE Cheng","year":"2012","unstructured":"Cheng TCE, Kellerer H, Kotov V (2012) Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper Res Lett 40(1):349\u2013352","journal-title":"Oper Res Lett"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Tang F, Nie J (2015) LS algorithm for semi-online scheduling jobs with non-decreasing processing times. International conference on computers, information system and industrial applications (CISIA)","DOI":"10.2991\/cisia-15.2015.155"},{"issue":"1","key":"42_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer H, Kotov V, Speranza MG, Zs Tuza (1997) Semi-online algorithms for the partition problem. Oper Res Lett 21(1):235\u2013242","journal-title":"Oper Res Lett"},{"issue":"1","key":"42_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G Zhang","year":"1997","unstructured":"Zhang G (1997) A simple semi-online algorithm for $$P_2 \/\/ C_{max}$$ with a buffer. Inf Process Lett 61(1):145\u2013148","journal-title":"Inf Process Lett"},{"issue":"1","key":"42_CR26","first-page":"355","volume":"72","author":"G Dosa","year":"2004","unstructured":"Dosa G, He Y (2004) Semi-online algorithms for parallel machine scheduling problems. Computing 72(1):355\u2013363","journal-title":"Computing"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"Lan Y, Chen X, Ding N, Dosa G, Han X (2012) Online Makespan scheduling with a buffer. Frontiers in algorithms and aspects in information and management, pp 161\u2013171","DOI":"10.1007\/978-3-642-29700-7_15"},{"issue":"1","key":"42_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ipl.2012.12.007","volume":"113","author":"X Chen","year":"2013","unstructured":"Chen X, Xu Z, Dosa G, Han X, Jiang H (2013) Semi-online hierarchical scheduling problems with buffer or re-arrangements. Inf Process Lett 113(1):127\u2013131","journal-title":"Inf Process Lett"},{"key":"42_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0172-5","author":"S Albers","year":"2016","unstructured":"Albers S, Hellwig M (2016) Online Makespan minimization with parallel schedules. Algorithmica. https:\/\/doi.org\/10.1007\/s00453-016-0172-5","journal-title":"Algorithmica"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Pinheiro V, Rzadca K, Trystram D (2012) Campaign scheduling, 19th International conference on high performance computing (HiPC), pp 1\u201310","DOI":"10.1109\/HiPC.2012.6507489"},{"key":"42_CR31","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among Combinatorial Problems, TR3, Department of Computer Science. University of Califormia at Berkeley, April","DOI":"10.1007\/978-1-4684-2001-2_9"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:08:23Z","timestamp":1646489303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_42","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}