{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T15:51:18Z","timestamp":1784562678428,"version":"3.55.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":[[1988,12]]},"DOI":"10.1007\/bf02276919","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T06:23:03Z","timestamp":1134109383000},"page":"353-359","source":"Crossref","is-referenced-by-count":81,"title":["An efficient algorithm for the job-shop problem with two jobs","Ein effizienter Algorithmus zur L\u00f6sung des Job-Shop-Scheduling-Problems mit zwei Jobs"],"prefix":"10.1007","volume":"40","author":[{"given":"P.","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02276919_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. Operations Research4, 244\u2013245 (1956).","journal-title":"Operations Research"},{"key":"BF02276919_CR2","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":"BF02276919_CR3","unstructured":"Carlier, J., Pinson, E.: A branch and bound method for the job-shop problem. Technical Report, Institut de Math\u00e9matique Appliqu\u00e9es, Universit\u00e9 de Angers, 1987."},{"key":"BF02276919_CR4","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.11.6.889","volume":"11","author":"W. H. Hardgrave","year":"1963","unstructured":"Hardgrave, W. H., Nemhauser, G. L.: A geometric model and a graphical algorithm for a sequencing problem. Operations Research11, 889\u2013900 (1963).","journal-title":"Operations Research"},{"key":"BF02276919_CR5","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-machines, unit-time, jobshop, schedule-length problem. Mathematics of Operations Research7, 354\u2013360 (1982).","journal-title":"Mathematics of Operations Research"},{"key":"BF02276919_CR6","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's results on job lot scheduling. Naval Research Logistic Quarterly3, 201\u2013203 (1956).","journal-title":"Naval Research Logistic Quarterly"},{"key":"BF02276919_CR7","volume-title":"Industrial Scheduling","author":"J. F. Muth","year":"1963","unstructured":"Muth, J. F., Thompson, G. L.: Industrial Scheduling. Englewood Cliffs, N. J.: Prentice-Hall 1963."},{"key":"BF02276919_CR8","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.8.6.782","volume":"8","author":"W. Szwarc","year":"1960","unstructured":"Szwarc, W.: Solution of the Akers-Friedman scheduling problem. Opertions Research8, 782\u2013788 (1960).","journal-title":"Opertions Research"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276919.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02276919\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:35Z","timestamp":1557930515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02276919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF02276919"],"URL":"https:\/\/doi.org\/10.1007\/bf02276919","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}