{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:27Z","timestamp":1759847907021},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01680372","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T22:15:02Z","timestamp":1152310502000},"page":"195-214","source":"Crossref","is-referenced-by-count":6,"title":["New steps in the amazing world of sequences and schedules"],"prefix":"10.1007","volume":"43","author":[{"given":"Heidemarie","family":"Br\u00e4sel","sequence":"first","affiliation":[]},{"given":"Martina","family":"Kleinau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01680372_CR1","doi-asserted-by":"crossref","unstructured":"Ashour S (1972) Sequencing theory. Springer Verlag","DOI":"10.1007\/978-3-642-80693-3"},{"key":"BF01680372_CR2","first-page":"429","volume":"3","author":"SB Akers","year":"1955","unstructured":"Akers SB, Friedman J (1955) A non-numerical approach to production scheduling problems. Oper Res 3:429\u2013442","journal-title":"Oper Res"},{"key":"BF01680372_CR3","volume-title":"Latin rectangle and scheduling theory (in German)","author":"H Br\u00e4sel","year":"1990","unstructured":"Br\u00e4sel H (1990) Latin rectangle and scheduling theory (in German). Habilitationsschrift TU Magdeburg"},{"key":"BF01680372_CR4","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 (1992) On the number of feasible schedules of the open-shop-problem \u2014 an application of special latin rectangles. Optimization 23:251\u2013260","journal-title":"Optimization"},{"key":"BF01680372_CR5","doi-asserted-by":"crossref","unstructured":"Br\u00e4sel H, Kleinau M (1992) On number problems for the open-shop problem. System Modelling and Optimization, Proceedings of the 15th IFIP Conference, 145\u2013155, Springer Verlag","DOI":"10.1007\/BFb0113281"},{"key":"BF01680372_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0377-2217(94)90335-2","volume":"72","author":"H Br\u00e4sel","year":"1994","unstructured":"Br\u00e4sel H, Kluge D, Werner F (1994) A polynomial algorithm for the [n\/m\/O, t ij ,tree\/C max ] open-shop problem. Europ J of Oper Res 72:125\u2013134","journal-title":"Europ J of Oper Res"},{"key":"BF01680372_CR7","doi-asserted-by":"crossref","unstructured":"Br\u00e4sel H, Kluge D, Werner F (1994) A polynomial algorithm for an open-shop problem with unit processing times and tree constraints. To appear in Discrete Applied Mathematics","DOI":"10.1016\/0166-218X(93)E0156-S"},{"key":"BF01680372_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","volume":"51","author":"H Br\u00e4sel","year":"1993","unstructured":"Br\u00e4sel H, Tautenhahn T, Werner F (1993) Heuristic constructive algorithms for them\u00a6n\u00a6O\u00a6C max problem. Computing 51:95\u2013110","journal-title":"Computing"},{"key":"BF01680372_CR9","unstructured":"Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addison-Wesley"},{"key":"BF01680372_CR10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzales","year":"1976","unstructured":"Gonzales T, Sahni S (1976) Open-shop scheduling to minimize finish time. J Assoc Comput Mach 23:665\u2013679","journal-title":"J Assoc Comput Mach"},{"key":"BF01680372_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RE Graham","year":"1979","unstructured":"Graham RE, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling \u2014 A survey. Ann Discrete Mathematics 5:287\u2013326","journal-title":"Ann Discrete Mathematics"},{"key":"BF01680372_CR12","unstructured":"Kleinau M (1993) On the structure of shop scheduling problems: Number problems, reducibility and complexity (in German). Dissertation TU Magdeburg"},{"key":"BF01680372_CR13","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. In: Graves SC et al (eds) Handbooks in Operations Research & Management Science 4:445\u2013522"},{"key":"BF01680372_CR14","unstructured":"Tautenhahn T (1994) Open-shop problems with unit processing times (in German). Dissertation Otto-von-Guericke-Universitt Magdeburg"},{"key":"BF01680372_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02248592","volume":"26","author":"D Werra De","year":"1990","unstructured":"De Werra D (1990) Almost nonpreemptive schedules. Ann Oper Res 26:243\u2013256","journal-title":"Ann Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680372.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01680372\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01680372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T19:45:30Z","timestamp":1557258330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01680372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01680372"],"URL":"https:\/\/doi.org\/10.1007\/bf01680372","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}