{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T13:15:21Z","timestamp":1720703721778},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02099698","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T20:03:31Z","timestamp":1126555411000},"page":"203-216","source":"Crossref","is-referenced-by-count":8,"title":["An efficient algorithm for a job shop problem"],"prefix":"10.1007","volume":"57","author":[{"given":"Wieslaw","family":"Kubiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Sethi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chelliah","family":"Sriskandarajah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02099698_CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02277185","volume":"27","author":"P. Brucker","year":"1981","unstructured":"P. Brucker, Minimizing maximum lateness in a two-machine unit-time job shop, Computing 27(1981)367\u2013370.","journal-title":"Computing"},{"key":"BF02099698_CR2","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/BFb0006180","volume-title":"Systems Modeling and Optimization","author":"P. Brucker","year":"1982","unstructured":"P. Brucker, A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop scheduling problem, in:Systems Modeling and Optimization, eds. R.F. Drenick and F. Kozin, Lecture Notes in Control and Information Sciences 38 (Springer, Berlin, 1982) pp. 566\u2013571."},{"key":"BF02099698_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(83)90117-5","volume":"16","author":"G.N. Frederickson","year":"1983","unstructured":"G.N. Frederickson, Scheduling unit-time tasks with integer release times and deadlines, Inf. Proc. Lett. 16(1983)171\u2013173.","journal-title":"Inf. Proc. Lett."},{"key":"BF02099698_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Gary","year":"1976","unstructured":"M.R. Gary, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(1976)117\u2013129.","journal-title":"Math. Oper. Res."},{"key":"BF02099698_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T. Gonzalez","year":"1978","unstructured":"T. Gonzalez and S. Sahni, Flowshop and jobshop schedules: Complexity and approximation, Oper. Res. 26(1978)36\u201352.","journal-title":"Oper. Res."},{"key":"BF02099698_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discr. Math. 5(1979)287\u2013326.","journal-title":"Ann. Discr. Math."},{"key":"BF02099698_CR7","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/moor.7.3.354","volume":"7","author":"N. Hefetz","year":"1982","unstructured":"N. Hefetz and I. Adiri, An efficient optimal algorithm for the two-machine unit-time jobshop schedule-length problem, Math. Oper. Res. 7(1982)354\u2013360.","journal-title":"Math. Oper. Res."},{"key":"BF02099698_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J.R. Jackson","year":"1956","unstructured":"J.R. Jackson, An extension of Johnson's results on job lot scheduling, Naval Res. Log. Quart. 3(1956)201\u2013203.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02099698_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"S.M. Johnson, Optimal two- and three-stage production schedules with set-up times included, Naval Res. Log. Quart. 1(1954)61\u201368.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02099698_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(89)90225-7","volume":"43","author":"W. Kubiak","year":"1989","unstructured":"W. Kubiak, A pseudopolynomial algorithm for a two-machine no-wait job shop scheduling problem, Euro. J. Oper. Res. 43(1989)267\u2013270.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02099698_CR11","unstructured":"W. Kubiak, S. Sethi and C. Sriskandarajah, Scheduling of a job shop with two machine centers having parallel machines, Working Paper No. 90-10, Department of Industrial Engineering, University of Toronto."},{"key":"BF02099698_CR12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Ann. Discr. Math. 1(1977)343\u2013362.","journal-title":"Ann. Discr. Math."},{"key":"BF02099698_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J.K. Lenstra","year":"1979","unstructured":"J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems, Ann. Discr. Math. 4(1979)121\u2013140.","journal-title":"Ann. Discr. Math."},{"key":"BF02099698_CR14","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C. Sriskandarajah","year":"1986","unstructured":"C. Sriskandarajah and P. Ladet, Some no-wait shops scheduling problems: Complexity aspects, Euro. J. Oper. Res. 24(1986)424\u2013438.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02099698_CR15","first-page":"109","volume":"2","author":"V.G. Timkovskiy","year":"1985","unstructured":"V.G. Timkovskiy, Polynomial algorithm for the Lenstra-Rinnooy Kan scheduling problem on two machines, Kibernetika 2(1985)109\u2013111 (in Russian).","journal-title":"Kibernetika"},{"key":"BF02099698_CR16","first-page":"46","volume":"5","author":"V.G. Timkovskiy","year":"1985","unstructured":"V.G. Timkovskiy, On the complexity of scheduling an arbitrary system, Sov. J. Comp. Syst. Sci. 5(1985)46\u201352.","journal-title":"Sov. J. Comp. Syst. Sci."},{"key":"BF02099698_CR17","series-title":"Working Paper","volume-title":"A regret method for unit-time scheduling problems","author":"J. Thepot","year":"1988","unstructured":"J. Thepot, A regret method for unit-time scheduling problems, Working Paper, BETA 8803, Universit\u00e9 Louis Pasteur, Strasbourg, France (1988)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099698.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02099698\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:41:15Z","timestamp":1557794475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02099698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02099698"],"URL":"https:\/\/doi.org\/10.1007\/bf02099698","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}