{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:38Z","timestamp":1725558998676},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_7","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"46-54","source":"Crossref","is-referenced-by-count":6,"title":["Competitive Strategies for On-line Production Order Disposal Problem"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqiang","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(01)00251-4","volume":"82","author":"L. Zhaohui","year":"2002","unstructured":"Zhaohui, L., Edwin Cheng, T.C.: Scheduling with job release dates, delivery times and preemption penalties. Information Processing Letters\u00a082(2), 107\u2013111 (2002)","journal-title":"Information Processing Letters"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/B:JOSH.0000046073.05827.15","volume":"7","author":"S. Dauzere-Peres","year":"2004","unstructured":"Dauzere-Peres, S., Sevaux, M.: An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of scheduling\u00a07(6), 405\u2013420 (2004)","journal-title":"Journal of scheduling"},{"issue":"8","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","volume":"30","author":"C.T. Daniel Ng","year":"2003","unstructured":"Daniel Ng, C.T., Edwin Cheng, T.C., Kovalyov, M.Y., Lam, S.S.: Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research\u00a030(8), 1173\u20131185 (2003)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"E.J. Anderson","year":"2004","unstructured":"Anderson, E.J., Potts, C.N.: Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research\u00a029(3), 686\u2013697 (2004)","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"7_CR5","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TAC.2004.825984","volume":"49","author":"C.F.M. Chou","year":"2004","unstructured":"Chou, C.F.M.: Asymptotic performance ratio of an online algorithm for the single machine scheduling with release dates. IEEE Transactions on Automatic Control\u00a049(5), 772\u2013776 (2004)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-27836-8_32","volume-title":"Automata, Languages and Programming","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tichy, T.: Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 358\u2013370. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Trjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:03Z","timestamp":1619505603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11496199_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}