{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002406},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_9","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"66-76","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms for Two Single Machine Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[]},{"given":"Weiya","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Huikun","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I. Adiri","year":"1989","unstructured":"Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flow-time schduling with a single breakdown. Acta Informatica\u00a026, 679\u2013696 (1989)","journal-title":"Acta Informatica"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/S0377-2217(03)00364-3","volume":"158","author":"Y.C. Chang","year":"2004","unstructured":"Chang, Y.C., Lee, C.Y.: Machine scheduling with job delivery coordination. European Journal of Operational Research\u00a0158, 470\u2013487 (2004)","journal-title":"European Journal of Operational Research"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0053969","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"H. Kellerer","year":"1998","unstructured":"Kellerer, H., Pferschy, U.: A new fully polynomial approximation scheme for the knapsack problem. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 123\u2013134. Springer, Heidelberg (1998)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"Lawler, E.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research\u00a04, 339\u2013356 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"C.Y. Lee","year":"1992","unstructured":"Lee, C.Y., Liman, S.D.: Single machine flow-time scheduling with scheduled mainteance. Acta Informatica\u00a029, 375\u2013382 (1992)","journal-title":"Acta Informatica"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"C. Sadfi","year":"2005","unstructured":"Sadfi, C., Penz, B., Rapine, C., B\u0142azewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research\u00a0161, 3\u201310 (2005)","journal-title":"European Journal of Operational Research"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin packing problem. Naval Research Logistics\u00a041, 579\u2013585 (1994)","journal-title":"Naval Research Logistics"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02009683","volume":"7","author":"M. Yue","year":"1991","unstructured":"Yue, M.: A simple proof of the inequality \n                    \n                      \n                    \n                    $FFD(L)\\leq \\frac{11}{9}OPT(L)+1$\n                   \u2200\u2009L, for the FFD bin-packing algorithm. Acta Math. Appl. Sinica\u00a07, 321\u2013331 (1991)","journal-title":"Acta Math. Appl. Sinica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:04Z","timestamp":1619505604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11496199_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}