{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T02:04:02Z","timestamp":1768615442966,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2007,7,12]],"date-time":"2007-07-12T00:00:00Z","timestamp":1184198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s10951-007-0027-7","type":"journal-article","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T20:35:18Z","timestamp":1184618118000},"page":"303-310","source":"Crossref","is-referenced-by-count":8,"title":["Single-machine scheduling with trade-off between number of tardy jobs and compression cost"],"prefix":"10.1007","volume":"10","author":[{"given":"Yong","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,12]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","volume":"21","author":"Z.-L. Chen","year":"1997","unstructured":"Chen, Z.-L., Lu, Q., & Tang, G. C. (1997). Single machine scheduling with discretely controllable processing times. Operations Research Letters, 21, 69\u201376.","journal-title":"Operations Research Letters"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0167-6377(96)00035-1","volume":"19","author":"T. C. E. Cheng","year":"1996","unstructured":"Cheng, T. C. E., Chen, Z.-L., & Li, C.-L. (1996). Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. Operations Research Letters, 19, 237\u2013242.","journal-title":"Operations Research Letters"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(94)00187-H","volume":"81","author":"P. De","year":"1995","unstructured":"De, P., Dunne, E. J., Ghosh, J. B., & Wells, C. E. (1995). The discrete time-cost trade-off problem revisited. European Journal of Operational Research, 81, 225\u2013238.","journal-title":"European Journal of Operational Research"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/opre.45.2.302","volume":"45","author":"P. De","year":"1997","unstructured":"De, P., Dunne, E. J., Ghosh, J. B., & Wells, C. E. (1997). Complexity of the discrete time-cost trade-off problem for project networks. Operations Research, 45, 302\u2013306.","journal-title":"Operations Research"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","volume":"37","author":"R. L. Daniels","year":"1989","unstructured":"Daniels, R. L., & Sarin, R. K. (1989). Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research, 37, 981\u2013984.","journal-title":"Operations Research"},{"key":"27_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-hardness","author":"M. R. Garey","year":"1978","unstructured":"Garey, M. R., & Johnson, D. S. (1978). Computers and intractability: a guide to the theory of NP-hardness. San Francisco: Freeman."},{"key":"27_CR7","volume-title":"Knapsack problems: algorithm and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: algorithm and computer implementations. Chichester: Wiley."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one-machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"25","author":"E. Nowicki","year":"1990","unstructured":"Nowicki, E., & Zdrzalka, S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 25, 271\u2013287.","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/moor.23.4.909","volume":"23","author":"M. Skutella","year":"1998","unstructured":"Skutella, M. (1998). Approximation algorithms for the discrete time-cost trade-off problem. Mathematics of Operations Research, 23, 909\u2013929.","journal-title":"Mathematics of Operations Research"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"L. N. Wassenhove Van","year":"1982","unstructured":"Van Wassenhove, L. N., & Baker, K. R. (1982). A bicriterion approach to time\/cost trade-offs in sequencing. European Journal of Operational Research, 11, 48\u201354.","journal-title":"European Journal of Operational Research"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"R. G. Vickson","year":"1980","unstructured":"Vickson, R. G. (1980a). Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research, 28, 1155\u20131167.","journal-title":"Operations Research"},{"key":"27_CR13","first-page":"258","volume":"12","author":"R. G. Vickson","year":"1980","unstructured":"Vickson, R. G. (1980b). Two single machine sequencing problems involving controllable job processing times. IIE Transactions, 12, 258\u2013262.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0027-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0027-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0027-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,12]]},"references-count":13,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0027-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,12]]}}}