{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:50Z","timestamp":1740141890086,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T00:00:00Z","timestamp":1529107200000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10288-018-0381-7","type":"journal-article","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T10:15:50Z","timestamp":1529144150000},"page":"97-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on posterior tight worst-case bounds for longest processing time schedules"],"prefix":"10.1007","volume":"17","author":[{"given":"Johnny C.","family":"Ho","sequence":"first","affiliation":[]},{"given":"Ivar","family":"Massab\u00f2","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8446-781X","authenticated-orcid":false,"given":"Giuseppe","family":"Paletta","sequence":"additional","affiliation":[]},{"given":"Alex J.","family":"Ruiz-Torres","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"key":"381_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/1520-6750(199104)38:2<273::AID-NAV3220380211>3.0.CO;2-A","volume":"38","author":"JD Blocher","year":"1991","unstructured":"Blocher JD, Chand S (1991) Scheduling of parallel processors: a posterior bound on LPT sequencing and a two-step algorithm. Naval Res Logist 38:273\u2013287","journal-title":"Naval Res Logist"},{"key":"381_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10951-015-0419-z","volume":"18","author":"JD Blocher","year":"2015","unstructured":"Blocher JD, Sevastyanov S (2015) A note on the Coffman\u2013Sethi bound for LPT scheduling. J Sched 18:325\u2013327","journal-title":"J Sched"},{"key":"381_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0167-6377(93)90024-B","volume":"14","author":"B Chen","year":"1993","unstructured":"Chen B (1993) A note on LPT scheduling. Oper Res Lett 14:139\u2013142","journal-title":"Oper Res Lett"},{"key":"381_CR4","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B Chen","year":"1998","unstructured":"Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du DZ, Pardalos P (eds) Handbook of combinatorial optimization, vol 3. Kluwer Academic, Dordrecht, pp 21\u2013169"},{"key":"381_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"TCE Cheng","year":"1990","unstructured":"Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47:271\u2013292","journal-title":"Eur J Oper Res"},{"key":"381_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1978) An application of bin-paking to multiprocessor scheduling. SIAM J Comput 7:1\u201317","journal-title":"SIAM J Comput"},{"key":"381_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/mnsc.34.3.266","volume":"34","author":"EG Coffman Jr","year":"1988","unstructured":"Coffman EG Jr, Lueker GS, Rinnooy Kan AHG (1988) Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics. Manag. Sci. 34:266\u2013290","journal-title":"Manag. Sci."},{"key":"381_CR8","first-page":"17","volume":"10","author":"EG Coffman Jr","year":"1976","unstructured":"Coffman EG Jr, Sethi R (1976) A generalized bound on LPT sequencing. RAIRO Inf 10:17\u201325","journal-title":"RAIRO Inf"},{"key":"381_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7:191\u2013200","journal-title":"ORSA J Comput"},{"key":"381_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(86)90060-0","volume":"14","author":"JBG Frenk","year":"1986","unstructured":"Frenk JBG, Rinnooy Kan AHG (1986) The rate of convergence to optimality of the LPT rule. Discrete Appl Math 14:187\u2013197","journal-title":"Discrete Appl Math"},{"key":"381_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1287\/moor.12.2.241","volume":"12","author":"JBG Frenk","year":"1987","unstructured":"Frenk JBG, Rinnooy Kan AHG (1987) The asymptotic optimality of the LPT rule. Math Oper Res 12:241\u2013254","journal-title":"Math Oper Res"},{"key":"381_CR12","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco"},{"key":"381_CR13","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 multiprocessing anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"381_CR14","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"381_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"381_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1080\/09537280150203951","volume":"12","author":"JND Gupta","year":"2001","unstructured":"Gupta JND, Ruiz-Torres AJ (2001) LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28\u201336","journal-title":"Prod Plan Control"},{"key":"381_CR17","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"OH Ibarra","year":"1977","unstructured":"Ibarra OH, Kim CE (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J Assoc Comput Mach 24:280\u2013289","journal-title":"J Assoc Comput Mach"},{"key":"381_CR18","unstructured":"Karmarkar N, Karp RM (1982) The differencing method of set partitioning. Technical report UCB\/CSD 82\/113. University of California, Berkeley"},{"key":"381_CR19","volume-title":"Handbooks in operations research and management science","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH (eds) Handbooks in operations research and management science, vol 4. Elsevier Science Publishers B.V., Amsterdam"},{"key":"381_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(88)90079-0","volume":"20","author":"CY Lee","year":"1988","unstructured":"Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233\u2013242","journal-title":"Discrete Appl Math"},{"issue":"2","key":"381_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10951-015-0453-x","volume":"19","author":"I Massab\u00f2","year":"2016","unstructured":"Massab\u00f2 I, Paletta G, Ruiz-Torres AJ (2016) A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem. J Sched 19(2):207\u2013211","journal-title":"J Sched"},{"key":"381_CR22","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problem: a survey. Asia Pac J Oper Res 18:193\u2013242","journal-title":"Asia Pac J Oper Res"},{"key":"381_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/050634657","volume":"21","author":"G Paletta","year":"2007","unstructured":"Paletta G, Pietramala P (2007) A new approximation algorithm for the nonpreemptive scheduling of independent jobs on identical parallel processors. SIAM J Discrete Math 21:313\u2013328","journal-title":"SIAM J Discrete Math"},{"key":"381_CR24","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.1137\/08071675X","volume":"23","author":"G Paletta","year":"2010","unstructured":"Paletta G, Vocaturo F (2010) A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm. SIAM J Discrete Math 23:2198\u20132203","journal-title":"SIAM J Discrete Math"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0381-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0381-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0381-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T19:03:18Z","timestamp":1560625398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0381-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,16]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0381-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,6,16]]},"assertion":[{"value":"3 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}