{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T07:59:48Z","timestamp":1777276788522,"version":"3.51.4"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":[[1990,12]]},"DOI":"10.1007\/bf02238804","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T12:20:39Z","timestamp":1131970839000},"page":"369-375","source":"Crossref","is-referenced-by-count":592,"title":["Job-shop scheduling with multi-purpose machines","Scheduling-Probleme in Jop-Shops mit Mehrzweckmaschinen"],"prefix":"10.1007","volume":"45","author":[{"given":"P.","family":"Brucker","sequence":"first","affiliation":[]},{"given":"R.","family":"Schlie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02238804_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":"BF02238804_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker, P., An efficient algorithm for the job-shop problem with two jobs, Computing40, 353\u2013359 (1988).","journal-title":"Computing"},{"key":"BF02238804_CR3","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":"BF02238804_CR4","doi-asserted-by":"crossref","unstructured":"Sotskov, Y. N., The complexity of shop-scheduling problems with two or three jobs. European Journal of Operations Research (in press).","DOI":"10.1016\/0377-2217(91)90066-5"},{"key":"BF02238804_CR5","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. Operations Research8, 782\u2013788 (1960).","journal-title":"Operations Research"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238804.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238804\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:13:00Z","timestamp":1557925980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF02238804"],"URL":"https:\/\/doi.org\/10.1007\/bf02238804","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}