{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:08:02Z","timestamp":1774418882461,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf01415528","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T12:32:18Z","timestamp":1112531538000},"page":"59-73","source":"Crossref","is-referenced-by-count":13,"title":["Open shop problems with unit time operations"],"prefix":"10.1007","volume":"37","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marion","family":"Jurisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Br\u00e4sel H (1990) Lateinische Rechtecke und Maschinenbelegung, Dissertation B, TU Magdeburg"},{"key":"CR2","unstructured":"Br\u00e4sel H, Kluge D, Werner F (1991) A polynomial algorithm for then\u00a6m\u00a6O\u00a6t ij =1;tree\u00a6C max problem, to appear in EJOR"},{"key":"CR3","volume-title":"A polynomial algorithm for an open shop problem with unit processing times and tree constraints","author":"H Br\u00e4sel","year":"1991","unstructured":"Br\u00e4sel H, Kluge D, Werner F (1991a) A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Preprint, Technische Universit\u00e4t Otto von Guericke, Magdeburg"},{"key":"CR4","volume-title":"A polynomial time algorithm for a 2-machine open shop problem with precedence constraints and unit processing times","author":"H Br\u00e4sel","year":"1992","unstructured":"Br\u00e4sel H, Kluge D, Werner F (1992) A polynomial time algorithm for a 2-machine open shop problem with precedence constraints and unit processing times, Preprint, Technische Universit\u00e4t Otto von Guericke, Magdeburg"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","volume":"2","author":"P Brucker","year":"1977","unstructured":"Brucker P, Garey MR, Johnson DS (1977) Scheduling equal-length tasks under treelike precedence constrains to minimize maximum lateness. Math. Oper. Res. 2:275?284","journal-title":"Math. Oper. Res."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman EG, Graham RL (1972) Optimal Scheduling for two-processor systems. Acta Informatika 1:200?213","journal-title":"Acta Informatika"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","volume":"11","author":"HN Gabow","year":"1982","unstructured":"Gabow HN, Kariv O (1982) Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11:117?129","journal-title":"SIAM J. Comput."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS (1976) Scheduling tasks with nonuniform deadlines on two processors. J. Assoc. Comput. Mach. 23:461?467","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey MR, Johnson DS (1977) Two-processor scheduling with start-times and deadlines. SIAM J. Comput. 6:416?426","journal-title":"SIAM J. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.7.1.57","volume":"7","author":"T Gonzalez","year":"1982","unstructured":"Gonzalez T (1982) Unit execution time shop problems. Math. Oper. Res. 7:57?66","journal-title":"Math. Oper. Res."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/322186.322194","volume":"27","author":"T Gonzalez","year":"1980","unstructured":"Gonzalez T, Johnson DS (1980) A new algorithm for preemptive scheduling of trees. J. Assoc. Comput. Mach. 27:287?312","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR12","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: a survey. Ann. Discrete Math. 5:287?326","journal-title":"Ann. Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"WA Horn","year":"1974","unstructured":"Horn WA (1974) Some simple scheduling algorithms. Naval Res. Logist. Quart. 21:177?185","journal-title":"Naval Res. Logist. Quart."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu TC (1961) Parallel sequencing and assembly line problems. Oper. Res. 9:841?848","journal-title":"Oper. Res."},{"key":"CR15","volume-title":"Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project","author":"JR Jackson","year":"1955","unstructured":"Jackson JR (1955) Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: R.E. Miller, J.W. Thatcher, Complexity of Computer Computations, Plenum Press, New York, pp. 85?103"},{"key":"CR17","first-page":"284","volume":"29","author":"W Kubiak","year":"1991","unstructured":"Kubiak W, Sriskandarajah C, Zaras K (1991) A note on the complexity of openshop scheduling problems. INFOR 29:284?294","journal-title":"INFOR"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in combinatorial optimization","author":"J Labetoulle","year":"1984","unstructured":"Labetoulle J, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1984) Preemptive scheduling of uniform machines subject to release dates. In: WR Pulleyblank (ed.), Progress in combinatorial optimization, Academic Press, New York, pp. 245?261"},{"key":"CR19","first-page":"27","volume":"10","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Sequencing to minimize the weighted number of tardy jobs. RAIRO Rech. Op\u00e9r. 10:5 Suppl. 27?33","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-94-009-7801-0_6","volume-title":"Deterministic and stochastic scheduling","author":"EL Lawler","year":"1982","unstructured":"Lawler EL (1982) Preemptive scheduling of precedence-constrained jobs on parallel machines. In: MAH Dempster, JK Lenstra, AHG Rinnooy Kan, Deterministic and stochastic scheduling, Reidel, Dordrecht, pp. 101?123"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra JK, Rinnooy Kan AHG (1978) Complexity of scheduling under precedence constraints. Oper. Res. 26:22?35","journal-title":"Oper. Res."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.36.4.553","volume":"36","author":"CY Liu","year":"1988","unstructured":"Liu CY, Bulfin RL (1988) Scheduling open shops with unit execution times to minimize functions of due dates. Oper. Res. 36:553?559","journal-title":"Oper. Res."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton R (1959) Scheduling with deadlines and loss functions. Management Sci. 6:1?12","journal-title":"Management Sci."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1287\/opre.27.4.792","volume":"25","author":"CL Monma","year":"1979","unstructured":"Monma CL (1979) The two machine maximum flow-time with series parallel precedence constraints: an algorithm and extensions. Oper. Res. 25:792?798","journal-title":"Oper. Res."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/T-C.1969.222573","volume":"C-18","author":"RR Muntz","year":"1969","unstructured":"Muntz RR, Coffman EG (1969) Optimal preemptive scheduling on two processor systems. IEEE Trans. Computers C-18:1014?1020","journal-title":"IEEE Trans. Computers"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321574.321586","volume":"17","author":"RR Muntz","year":"1970","unstructured":"Muntz RR, Coffman EG (1970) Preemptive scheduling of real time tasks on multiprocessor systems. J. Assoc. Comput. Mach. 17:324?338","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR27","first-page":"51","volume-title":"Computer and job-shop scheduling theory","author":"R Sethi","year":"1976","unstructured":"Sethi R (1976) Algorithms for minimal length schedules. In: JR Coffman, Computer and job-shop scheduling theory. Wiley, New York, pp. 51?99"},{"key":"CR28","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization, Algorithms and complexity, Prentice-Hall"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Simons B, Warmuth MK (1989) A fast algorithm for multiprocessor scheduling of unit length jobs. SIAM J. Comput., to appear","DOI":"10.1137\/0218048"},{"key":"CR30","volume-title":"Theory of scheduling-multistage systems","author":"VS Tanaev","year":"1989","unstructured":"Tanaev VS, Sotskov YN, Strusewich VA (1989) Theory of scheduling-multistage systems, Moscow, Nauka (in Russian)"},{"key":"CR31","volume-title":"Minimizing maximal lateness for open shop witht ij =1 and release times","author":"T Tautenhahn","year":"1991","unstructured":"Tautenhahn T (1991) Minimizing maximal lateness for open shop witht ij =1 and release times, Preprint, Technische Universit\u00e4t, Magdeburg"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) NP-Complete scheduling problems. J. Comput. System Sci. 10:384?393","journal-title":"J. Comput. System Sci."}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415528.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415528\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:06:01Z","timestamp":1556877961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01415528"],"URL":"https:\/\/doi.org\/10.1007\/bf01415528","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}