{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:04Z","timestamp":1772717524867,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,3,1]],"date-time":"1980-03-01T00:00:00Z","timestamp":320716800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1980,3]]},"DOI":"10.1007\/bf02242792","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T19:27:37Z","timestamp":1131996457000},"page":"61-86","source":"Crossref","is-referenced-by-count":6,"title":["On strictly optimal schedules for the cumulative cost-optimal scheduling problem","\u00dcber streng optimale Reihenfolgen f\u00fcr das kumulative kosten-optimale Reihenfolgeproblem"],"prefix":"10.1007","volume":"24","author":[{"given":"H. M.","family":"Abdel-Wahab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02242792_CR1","unstructured":"Abdel-Wahab, H. M.: Scheduling with applications to register allocation and deadlock problems. Ph. D. Thesis, University of Waterloo, 1976."},{"key":"BF02242792_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/opre.26.1.141","volume":"26","author":"H. M. Abdel-Wahab","year":"1977","unstructured":"Abdel-Wahab, H. M., Kameda, T.: Scheduling to minimize the maximum cumulative cost subject to series-parallel precedence constraints. Opns. Res.26, 141\u2013159 (1977).","journal-title":"Opns. Res."},{"key":"BF02242792_CR3","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, Mass: Addison-Wesley 1974."},{"key":"BF02242792_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S. A.: The complexity of theorem-proving procedures. Proc. Third Annual ACM Symp. Theory of Computing, Shaker Heights, Ohio, 1970, 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"BF02242792_CR5","first-page":"85","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1973","unstructured":"Karp, R. M.: Reducibility among combinatorial problems, in: Complexity of Computer Computations (Miller, R. E., Thatcher, J. W., eds.), pp. 85\u2013103. New York: Plenum Press 1973."},{"key":"BF02242792_CR6","volume-title":"The art of computer programming, Vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. 3. Reading, Mass.: Addison-Wesley 1973."},{"key":"BF02242792_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E. L. Lawler","year":"1978","unstructured":"Lawler, E. L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Math.2, 75\u201390 (1978).","journal-title":"Annals of Discrete Math."},{"key":"BF02242792_CR8","unstructured":"Lawler, E. L., Tarjan, R. E., Valdez, J.: Analysis and isomorphism of series-parallel digraphs (to appear)."},{"key":"BF02242792_CR9","doi-asserted-by":"crossref","unstructured":"Monma, C. L., Sidney, J. B.: Sequencing with series-parallel precedence constraints. Math. of Operations Res. (to appear).","DOI":"10.1287\/moor.4.3.215"},{"key":"BF02242792_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/opre.23.2.283","volume":"23","author":"J. B. Sidney","year":"1975","unstructured":"Sidney, J. B.: Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Opns. Res.23, 283\u2013298 (1975).","journal-title":"Opns. Res."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242792.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02242792\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02242792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:41:00Z","timestamp":1586554860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02242792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,3]]}},"alternative-id":["BF02242792"],"URL":"https:\/\/doi.org\/10.1007\/bf02242792","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,3]]}}}