{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:56:32Z","timestamp":1772297792381,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319080154","type":"print"},{"value":"9783319080161","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_15","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"158-169","source":"Crossref","is-referenced-by-count":6,"title":["Parallel-Machine Scheduling Problem under the Job Rejection Constraint"],"prefix":"10.1007","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-44676-1_16","volume-title":"Algorithms - ESA 2001","author":"E. Angel","year":"2001","unstructured":"Angel, E., Bampis, E., Kononov, A.: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 194\u2013205. Springer, Heidelberg (2001)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Spaccamela, A.M., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics\u00a013, 64\u201378 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"Z. Cao","year":"2009","unstructured":"Cao, Z., Yang, X.: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science\u00a0410, 2732\u20132745 (2009)","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z. Cao","year":"2007","unstructured":"Cao, Z., Zhang, Y.: Scheduling with rejection and non-identical job arrivals. Journal of Systems Science and Complexity\u00a020, 529\u2013535 (2007)","journal-title":"Journal of Systems Science and Complexity"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"Y. Cheng","year":"2009","unstructured":"Cheng, Y., Sun, S.: Scheduling linear deteriorating jobs with rejection on a single machine. European Journal of Operational Research\u00a0194, 18\u201327 (2009)","journal-title":"European Journal of Operational Research"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"D.W. Engels","year":"2003","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. Journal of Algorithms\u00a049, 175\u2013191 (2003)","journal-title":"Journal of Algorithms"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of Association for Computing Machinery\u00a034, 144\u2013162 (1987)","journal-title":"Journal of Association for Computing Machinery"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H. Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Mathematics Programming\u00a094, 361\u2013374 (2003)","journal-title":"Mathematics Programming"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM\u00a023, 317\u2013327 (1976)","journal-title":"Journal of the ACM"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Jansen, K., Porkolab, L.: Improved approximation schemes for scheduling unrelated parallel machines. In: Proceedings of STOS 1999, 408- 417 (1999)","DOI":"10.1145\/301250.301361"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science\u00a04, 445\u2013452 (1993)","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5-Approximation algorithms with minimum packing constraint violation. In: Proceedings of STOS 1992, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L. Lu","year":"2008","unstructured":"Lu, L., Zhang, L., Yuan, J.: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science\u00a0396, 283\u2013289 (2008)","journal-title":"Theoretical Computer Science"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L. Lu","year":"2009","unstructured":"Lu, L., Cheng, T.C.E., Yuan, J., Zhang, L.: Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers & Operation Research\u00a036, 2748\u20132751 (2009)","journal-title":"Computers & Operation Research"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.tcs.2009.12.008","volume":"411","author":"S. Lu","year":"2010","unstructured":"Lu, S., Feng, H., Li, X.: Minimizing the makespan on a single parallel batching machine. Theoretical Computer Science\u00a0411, 1140\u20131145 (2010)","journal-title":"Theoretical Computer Science"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S. Seiden","year":"2001","unstructured":"Seiden, S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science\u00a0262, 437\u2013458 (2001)","journal-title":"Theoretical Computer Science"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D. Shabtay","year":"2012","unstructured":"Shabtay, D., Gaspar, N., Yedidsion, L.: A bicriteria approach to scheduling a single machine with job rejection and positional penalties. Journal of Combinatorial Optimization\u00a023, 395\u2013424 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D. Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. Journal of Scheduling\u00a016, 3\u201328 (2013)","journal-title":"Journal of Scheduling"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L. Zhang","year":"2009","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single machine scheduling with release dates and rejection. European Journal of Operational Research\u00a0198, 975\u2013978 (2009)","journal-title":"European Journal of Operational Research"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L. Zhang","year":"2010","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single-machine scheduling under the job rejection constraint. Theoretical Computer Science\u00a0411, 1877\u20131882 (2010)","journal-title":"Theoretical Computer Science"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-02026-1_39","volume-title":"Combinatorial Optimization and Applications","author":"Y. Zhang","year":"2009","unstructured":"Zhang, Y., Ren, J., Wang, C.: Scheduling with rejection to minimize the makespan. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 411\u2013420. Springer, Heidelberg (2009)"}],"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-319-08016-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:33:02Z","timestamp":1558899182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_15"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}