{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:20Z","timestamp":1725643580455},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003878"},{"type":"electronic","value":"9783642555374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-642-55537-4_34","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T20:12:30Z","timestamp":1323979950000},"page":"211-216","source":"Crossref","is-referenced-by-count":1,"title":["Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times"],"prefix":"10.1007","author":[{"given":"Aleksander","family":"Bachman","sequence":"first","affiliation":[]},{"given":"Adam","family":"Janiak","sequence":"additional","affiliation":[]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"711720","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B Alidaee","year":"1999","unstructured":"B. Alidaee, N.K. Womer, \u201cScheduling with time dependent processing times: Review and extensions\u201d, Journal of the Operational Research Society, 50, 711720 (1999).","journal-title":"Journal of the Operational Research Society"},{"key":"34_CR2","series-title":"Freeman, San Francisco","volume-title":"\u201cComputersand Intractability: A Guide to the Theory of NP-completeness\u201d","author":"MR Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson, \u201cComputersand Intractability: A Guide to the Theory of NP-completeness\u201d, Freeman, San Francisco, 1979."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, \u201cOptimization and approximation in deterministic sequencing and scheduling: a survey\u201d, Annals of Discrete Mathematics, 5, 287\u2013326 (1979).","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Operations Research Proceedings 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55537-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T02:58:59Z","timestamp":1555901939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55537-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540003878","9783642555374"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55537-4_34","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}