{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T13:46:56Z","timestamp":1744897616708},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s00186-005-0014-8","type":"journal-article","created":{"date-parts":[[2005,10,17]],"date-time":"2005-10-17T09:58:56Z","timestamp":1129543136000},"page":"63-75","source":"Crossref","is-referenced-by-count":7,"title":["Scheduling chains with identical jobs and constant delays on a single machine"],"prefix":"10.1007","volume":"63","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ceyda","family":"O\u011fuz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s006070050036","volume":"63","author":"P. Brucker","year":"1999","unstructured":"Brucker P., Knust S. (1999). Complexity results for single-machine problems with positive finish-start time-lags. Computing 63:299\u2013316","journal-title":"Computing"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s001860200242","volume":"57","author":"A. Munier","year":"2003","unstructured":"Munier A., Sourd F. (2003). Scheduling chains on a single machine with non-negative time-lags. Math Meth Oper Res 57:111\u2013123","journal-title":"Math Meth Oper Res"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","volume":"16","author":"Wikum","year":"1994","unstructured":"Wikum ED., Llewellyn DC., Nemhauser GL. (1994). One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87\u201399","journal-title":"Oper Res Lett"},{"key":"14_CR4","unstructured":"Yu W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. PhD Thesis, Technische Universiteit Eindhoven"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0014-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-005-0014-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-005-0014-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:23Z","timestamp":1558622003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-005-0014-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s00186-005-0014-8","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}