{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:53Z","timestamp":1725490313105},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_16","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T05:31:44Z","timestamp":1188624704000},"page":"172-177","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness"],"prefix":"10.1007","author":[{"given":"Shuyan","family":"Bai","sequence":"first","affiliation":[]},{"given":"Fuzeng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shuguang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Qiming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: The Proceeding of the 40th Annual Symposium on Foundations of Computer Science, New York, pp. 32\u201343 (October 1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyvov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling\u00a01, 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"key":"16_CR3","first-page":"685","volume":"33","author":"T.C.E. Cheng","year":"2001","unstructured":"Cheng, T.C.E., Liu, Z., Yu, W.: Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Transactions\u00a033, 685\u2013690 (2001)","journal-title":"IIE Transactions"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-45678-3_3","volume-title":"Algorithms and Computation","author":"X. Deng","year":"2001","unstructured":"Deng, X., Feng, H., Zhang, P., Zhao, H.: A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 26\u201335. Springer, Heidelberg (2001)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48686-0_23","volume-title":"Computing and Combinatorics","author":"X. Deng","year":"1999","unstructured":"Deng, X., Zhang, Y.: Minimizing mean response time in batch processing system. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/SFCS.1989.63468","volume-title":"Proceedings of the 30th annual IEEE Symposium on Foundations of Computer Science","author":"L.A. Hall","year":"1989","unstructured":"Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th annual IEEE Symposium on Foundations of Computer Science, pp. 134\u2013139. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.15807\/jorsj.22.205","volume":"22","author":"H. Kise","year":"1979","unstructured":"Kise, H., Ibaraki, T., Mine, H.: Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society of Japan\u00a022, 205\u2013224 (1979)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"16_CR8","series-title":"Logistics of Production and Inventory","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., Kan, A.H.G.R., Zipkin, P.H. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol.\u00a04, pp. 445\u2013522. North-Holland, Amsterdam (1993)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C Y. Lee","year":"1992","unstructured":"Lee, C Y., Uzsoy, R., Martin, L.A.: Vega, Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research\u00a040, 764\u2013775 (1992)","journal-title":"Operations Research"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0167-6377(02)00186-4","volume":"31","author":"Z. Liu","year":"2003","unstructured":"Liu, Z., Yuan, J., Cheng, T.C.E.: On scheduling an unbounded batch machine. Operations Research Letters\u00a031, 42\u201348 (2003)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73814-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:14Z","timestamp":1619517614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_16","relation":{},"subject":[]}}