{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:19:20Z","timestamp":1695579560634},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":[[1998,3]]},"DOI":"10.1007\/bf02684330","type":"journal-article","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T03:51:56Z","timestamp":1187754716000},"page":"73-79","source":"Crossref","is-referenced-by-count":9,"title":["Makespan minimization in preemptive two machine job shops"],"prefix":"10.1007","volume":"60","author":[{"given":"S. V.","family":"Sevastianov","sequence":"first","affiliation":[]},{"given":"G. J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02684330_CR1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","volume":"4","author":"S. B. Akers","year":"1956","unstructured":"Akers, S. B.: A graphical approach to production scheduling problems. Oper. Res.4, 244\u2013245 (1956).","journal-title":"Oper. Res."},{"key":"BF02684330_CR2","volume-title":"Osnabr\u00fccker Schriften zur Mathematik,184","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Kravchenko, S. A., Sotskov, Y. N.: Preemptive job-shop scheduling problems with a fixed number of jobs. Osnabr\u00fccker Schriften zur Mathematik,184, Universit\u00e4t Osnabr\u00fcck, Germany (1997)."},{"key":"BF02684330_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T. Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res.26, 36\u201352 (1978).","journal-title":"Oper. Res."},{"key":"BF02684330_CR4","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math.17, 416\u2013429 (1969).","journal-title":"SIAM J. Appl. Math."},{"key":"BF02684330_CR5","doi-asserted-by":"crossref","unstructured":"Hall, L. A.: Approximability of flow shop scheduling. In: Proceedings of 36th IEEE Symposium on Foundations of Computer Science, pp. 82\u201391 (1995).","DOI":"10.1109\/SFCS.1995.492465"},{"key":"BF02684330_CR6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/moor.7.3.354","volume":"7","author":"N. Hefetz","year":"1982","unstructured":"Hefetz, N., Adiri, I.: An efficient optimal algorithm for the two-machine, unit-time, jobshop, schedule-length problem. Math. Oper. Res.7, 354\u2013360 (1982).","journal-title":"Math. Oper. Res."},{"key":"BF02684330_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J. R. Jackson","year":"1956","unstructured":"Jackson, J. R.: An extension of Johnson\u2019s result on job lot scheduling. Naval. Res. Log. Q.3, 201\u2013203 (1956).","journal-title":"Naval. Res. Log. Q."},{"key":"BF02684330_CR8","first-page":"445","volume-title":"Handbooks in Operations Research and Management Science, Vol. 4","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science, Vol. 4, pp. 445\u2013522. Amsterdam: North Holland, 1993."},{"key":"BF02684330_CR9","unstructured":"Sevastianov, S. V., Woeginger, G. J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. to appear (1997)."},{"key":"BF02684330_CR10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D. B. Shmoys","year":"1996","unstructured":"Shmoys, D. B., Stein, C., Wein, J.: Improved approximation algorithm for shop scheduling problems. SIAM. J. Comput.23, 617\u2013632 (1996).","journal-title":"SIAM. J. Comput."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684330.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684330\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T18:22:37Z","timestamp":1558203757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["BF02684330"],"URL":"https:\/\/doi.org\/10.1007\/bf02684330","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}