{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:04:47Z","timestamp":1761487487845},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":[[1993,6]]},"DOI":"10.1007\/bf02243845","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T21:31:28Z","timestamp":1132003888000},"page":"95-110","source":"Crossref","is-referenced-by-count":50,"title":["Constructive heuristic algorithms for the open shop problem"],"prefix":"10.1007","volume":"51","author":[{"given":"H.","family":"Br\u00e4sel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Tautenhahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02243845_CR1","unstructured":"Br\u00e4sel, H.: Lateinische Rechtecke und Maschinenbelegung; Dissertation B, TU Magdeburg (1990)."},{"key":"BF02243845_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/02331939208843762","volume":"23","author":"H. Br\u00e4sel","year":"1992","unstructured":"Br\u00e4sel, H., Kleinau, M.: On the number of feasible schedules of the open-shop problem\u2014an applicaton of special Latin rectangles. Optimization23, 251\u2013260 (1992).","journal-title":"Optimization"},{"key":"BF02243845_CR3","first-page":"41","volume":"33","author":"H. Br\u00e4sel","year":"1989","unstructured":"Br\u00e4sel, H., Tautenhahn, T.: Zur n\u00e4herungsweisen L\u00f6sung eines open-shop Problems; Wiss. Z. TU Magdeburg33, 41\u201344 (1989).","journal-title":"Z. TU Magdeburg"},{"key":"BF02243845_CR4","unstructured":"Chen, B., Strusevitch, V.: Worst-case analysis of dense schedules for the three machine open shop scheduling. Preprint, Rotterdam (1991)."},{"key":"BF02243845_CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search\u2014Part 1. ORSA J. Comput.1, 190\u2013206 (1989).","journal-title":"ORSA J. Comput."},{"key":"BF02243845_CR6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzales","year":"1976","unstructured":"Gonzales, T., Sahni, S.: Open-shop scheduling to minimize finish time. J. Assoc. Comput. Mach.23, 665\u2013680 (1976).","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02243845_CR7","unstructured":"Kleinau, U.: On some new methods for solving machine scheduling problems. Preprint, 16\/91, TU Magdeburg (1991)."},{"key":"BF02243845_CR8","unstructured":"Lageweg, B. J., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G.: Computer aided complexity classification of deterministic scheduling problems. Department of Operations Research, Statistics and System Theory, Report BW 138\/81 (1981)."},{"key":"BF02243845_CR9","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. Department of Operations Research, Statistics and System theory, Report BS-R8909 (1989)."},{"key":"BF02243845_CR10","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. ORWP89\/21 (1989)."},{"key":"BF02243845_CR11","volume-title":"Theory of scheduling\u2014multistage systems","author":"V. S. Taneav","year":"1989","unstructured":"Taneav, V. S., Sotskov, Y. N., Strusewitch, V. A.: Theory of scheduling\u2014multistage systems. Nauka, Moskau 1989) (in Russian)."},{"key":"BF02243845_CR12","unstructured":"Werner, F., Winkler, A.: Insertion techniques for the Heuristic solution of the job shop problem. to appear in Discrete Appl. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243845.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243845\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:31:53Z","timestamp":1557876713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF02243845"],"URL":"https:\/\/doi.org\/10.1007\/bf02243845","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}