{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:30:09Z","timestamp":1779316209117,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540340218","type":"print"},{"value":"9783540340225","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_8","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T02:11:16Z","timestamp":1146708676000},"page":"90-98","source":"Crossref","is-referenced-by-count":27,"title":["On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times"],"prefix":"10.1007","author":[{"given":"Zhigang","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoupeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM Journal of Discrete Maths\u00a013, 64\u201378 (2000)","journal-title":"SIAM Journal of Discrete Maths"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","volume":"21","author":"Z. Chen","year":"1997","unstructured":"Chen, Z., Lu, Q., Tang, G.: Single machine scheduling with discretely controllable processing times. Operations Research Letters\u00a021, 69\u201376 (1997)","journal-title":"Operations Research Letters"},{"key":"8_CR3","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithmthms and approximability. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a03, pp. 21\u2013169. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1287\/opre.42.3.504","volume":"42","author":"R.L. Daniels","year":"1994","unstructured":"Daniels, R.L., Mazzola, J.B.: Flow shop scheduling with resource flexibility. Operations Research\u00a042, 504\u2013522 (1994)","journal-title":"Operations Research"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/3-540-68530-8_41","volume-title":"Algorithms - ESA 1998","author":"D.W. Engels","year":"1998","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 490\u2013501. Springer, Heidelberg (1998)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters\u00a030, 415\u2013420 (2002)","journal-title":"Operations Research Letters"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y. He","year":"2000","unstructured":"He, Y., Min, X.: On-line uniform machine scheduling with rejection. Computing\u00a065, 1\u201312 (2000)","journal-title":"Computing"},{"key":"8_CR9","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. Mathematical Programming, Serial B\u00a094, 361\u2013374 (2003)","journal-title":"Mathematical Programming, Serial B"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00607-001-1441-x","volume":"68","author":"H. Hoogeveen","year":"2002","unstructured":"Hoogeveen, H., Woeginger, G.J.: Some comments on sequencing with controllable processing times. Computing\u00a068, 181\u2013192 (2002)","journal-title":"Computing"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexities of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexities of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science\u00a0262(1), 437\u2013458 (2001)","journal-title":"Theoretical Computer Science"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume-title":"Algorithms and Data Structures","author":"S. Sengupta","year":"2003","unstructured":"Sengupta, S.: Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 79\u201390. Springer, Heidelberg (2003)"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R.G. Vickson","year":"1980","unstructured":"Vickson, R.G.: Two single machine sequencing problems involving controllable job processing times. AIIE Transactions\u00a012, 258\u2013262 (1980)","journal-title":"AIIE Transactions"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"R.G. Vickson","year":"1980","unstructured":"Vickson, R.G.: Choosing the job sequence and processing times to minimize the total processing plus flow cost on a single machine. Operations Research\u00a028, 1155\u20131167 (1980)","journal-title":"Operations Research"},{"issue":"6","key":"8_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0020-0190(01)00143-0","volume":"79","author":"G. Wan","year":"2001","unstructured":"Wan, G., Yen, B.P.-C., Li, C.-L.: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Information Processing Letters\u00a079(6), 273\u2013280 (2001)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T05:12:42Z","timestamp":1683436362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11750321_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}