{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:22:01Z","timestamp":1648693321733},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T00:00:00Z","timestamp":1458259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11424-016-4187-4","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T17:36:55Z","timestamp":1458322615000},"page":"1293-1301","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling problems with rejection to minimize the maximum flow time"],"prefix":"10.1007","volume":"29","author":[{"given":"Liqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"4187_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Spaccamela A M, Sgall J, and Stougie L, Multiprocessor scheduling with rejection, SIAM Journal on Discrete Mathematics, 2000, 13: 13\u201364.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4187_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen H, Skutella M, and Woeginger G J, Preemptive scheduling with rejection, Mathematics Programming, 2003, 94: 94\u2013361.","journal-title":"Mathematics Programming"},{"key":"4187_CR3","doi-asserted-by":"crossref","first-page":"49","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, and Wein J, Techniques for scheduling with rejection, Journal of Algorithms, 2003, 49: 49\u2013175.","journal-title":"Journal of Algorithms"},{"key":"4187_CR4","first-page":"198","volume":"198","author":"L Q Zhang","year":"2009","unstructured":"Zhang L Q, Lu L F, and Yuan J J, Single machine scheduling with release dates and rejection, European Journal of Operational Research, 2009, 198: 198\u2013975.","journal-title":"European Journal of Operational Research"},{"key":"4187_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/opre.1110.0948","volume":"59","author":"G Steiner","year":"2011","unstructured":"Steiner G and Zhang R, Revised delivery-time quotation in scheduling with tardiness penalties, Operations Research, 2011, 59: 59\u20131504.","journal-title":"Operations Research"},{"key":"4187_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, and Kaspi M, A survey on off-line scheduling with rejection, Journal of Scheduling, 2013, 16: 16\u20133.","journal-title":"Journal of Scheduling"},{"key":"4187_CR7","doi-asserted-by":"crossref","first-page":"262","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, 2001, 262: 262\u2013437.","journal-title":"Theoretical Computer Science"},{"key":"4187_CR8","first-page":"30","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein L, Noga J, and Woeginger G J, On-line scheduling of unit time jobs with rejection: Minimizing the total completion time, Operations Research Letters, 2002, 30: 30\u2013415.","journal-title":"Operations Research Letters"},{"key":"4187_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/s10878-006-9003-y","volume":"12","author":"G Dosa","year":"2006","unstructured":"Dosa G and He Y, Scheduling with machine cost and rejection, Journal of Combinatorial Optimization, 2006, 12: 12\u2013337.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"4187_CR10","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z G Cao","year":"2007","unstructured":"Cao Z G and Zhang Y Z, Scheduling with rejection and non-identical job arrivals, Journal of Systems Science and Complexity, 2007, 20(4): 529\u2013535.","journal-title":"Journal of Systems Science and Complexity"},{"key":"4187_CR11","first-page":"130","volume":"130","author":"L F Lu","year":"2011","unstructured":"Lu L F, Ng C T, and Zhang L Q, Optimal algorithms for single-machine scheduling with rejection to minimize the makespan, Interational Journal of Production Economics, 2011, 130: 130\u2013153.","journal-title":"Interational Journal of Production Economics"},{"key":"4187_CR12","first-page":"113","volume":"113","author":"R Ma","year":"2013","unstructured":"Ma R and Yuan J J, On-line scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost, Information Processing Letters, 2013, 113: 113\u2013593.","journal-title":"Information Processing Letters"},{"key":"4187_CR13","first-page":"2751","volume":"2751","author":"M Mastrolilli","year":"2003","unstructured":"Mastrolilli M, Scheduling to minimize max flow time: off-line and on-line algorithms, Lecture Notes in Computer Science, 2003, 2751: 2751\u201349.","journal-title":"Lecture Notes in Computer Science"},{"key":"4187_CR14","volume-title":"Computers and Intractablity: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R and Johnson D S, Computers and Intractablity: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-016-4187-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-016-4187-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-016-4187-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-016-4187-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:54:10Z","timestamp":1559386450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-016-4187-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,18]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["4187"],"URL":"https:\/\/doi.org\/10.1007\/s11424-016-4187-4","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,18]]}}}