{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:29:54Z","timestamp":1761488994997},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T00:00:00Z","timestamp":1347667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10878-012-9546-z","type":"journal-article","created":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T09:52:15Z","timestamp":1347702735000},"page":"308-325","source":"Crossref","is-referenced-by-count":3,"title":["Discrete optimization with polynomially detectable boundaries and restricted level sets"],"prefix":"10.1007","volume":"25","author":[{"given":"Yakov","family":"Zinder","sequence":"first","affiliation":[]},{"given":"Julia","family":"Memar","sequence":"additional","affiliation":[]},{"given":"Gaurav","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,15]]},"reference":[{"key":"9546_CR1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS (1976) Scheduling tasks with nonuniform deadlines on two processors. J ACM 23:461\u2013467","journal-title":"J ACM"},{"key":"9546_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"JA Hoogeveen","year":"1994","unstructured":"Hoogeveen JA, van\u00a0de Velde SL, Veltman B (1994) Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl Math 55:259\u2013272","journal-title":"Discrete Appl Math"},{"key":"9546_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra JK, Rinnooy Kan AHG (1978) Complexity of scheduling under precedence constraints. Oper Res 26:22\u201335","journal-title":"Oper Res"},{"key":"9546_CR4","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo M (2008) Scheduling: theory, algorithms, and systems, 3rd edn. Springer, Berlin","edition":"3"},{"key":"9546_CR5","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) NP-complete scheduling problems. J Comput Syst Sci 10:384\u2013393","journal-title":"J Comput Syst Sci"},{"key":"9546_CR6","first-page":"531","volume-title":"Proceedings, MISTA","author":"Y Zinder","year":"2007","unstructured":"Zinder Y (2007) The strength of priority algorithms. In: Proceedings, MISTA, pp 531\u2013537"},{"key":"9546_CR7","first-page":"391","volume-title":"Proceedings, A.C. Aitken centenary conference","author":"Y Zinder","year":"1995","unstructured":"Zinder Y, Roper D (1995) A minimax combinatorial optimization problem on an acyclic directed graph: polynomial-time algorithms and complexity. In: Proceedings, A.C. Aitken centenary conference, pp\u00a0391\u2013400"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9546-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9546-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9546-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9546-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,15]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9546"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9546-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,15]]}}}