{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:32Z","timestamp":1759847372470},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":[[1997,6]]},"DOI":"10.1007\/bf02684434","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T05:06:17Z","timestamp":1186549577000},"page":"97-111","source":"Crossref","is-referenced-by-count":8,"title":["Unit-time scheduling problems with time dependent resources"],"prefix":"10.1007","volume":"58","author":[{"given":"T.","family":"Tautenhahn","sequence":"first","affiliation":[]},{"given":"G. J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02684434_CR1","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Cellary, W., Slowinski, R., Weglarz, J.: Scheduling under resource constraints \u2014 deterministic models. Ann. Oper. Res.7 (1996).","DOI":"10.1007\/978-3-662-03217-6_9"},{"key":"BF02684434_CR2","first-page":"80","volume":"2","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. OR Lett.2, 80\u201383 (1983).","journal-title":"OR Lett."},{"key":"BF02684434_CR3","volume-title":"Lateinische Rechtecke und Maschinenbelegung","author":"H. Br\u00e4sel","year":"1991","unstructured":"Br\u00e4sel, H.: Lateinische Rechtecke und Maschinenbelegung. Dissertation B, TU Magdeburg, 1991."},{"key":"BF02684434_CR4","unstructured":"Gabow, H., Nishizeki, T., Kariv, O., Leven, D., Terada, O.: Algorithms for edge-colouring graphs. Technical Report 41, University of Colorado at Boulder, 1985."},{"key":"BF02684434_CR5","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability. San Francisco: W.H. Freeman, 1979."},{"key":"BF02684434_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. E. Graham","year":"1979","unstructured":"Graham, R. E., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math.5, 287\u2013326 (1979).","journal-title":"Ann. Disc. Math."},{"key":"BF02684434_CR7","unstructured":"Jurisch, B., Kubiak, W.: Open shops with renewable resources. Working paper, Memorial University of Newfoundland, 1994."},{"key":"BF02684434_CR8","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra","year":"1983","unstructured":"Lenstra, H. W.: Integer programming with a fixed number of variables. Math. Oper. Res.8, 538\u2013548 (1983).","journal-title":"Math. Oper. Res."},{"key":"BF02684434_CR9","first-page":"216","volume-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","author":"T. J. Schaefer","year":"1978","unstructured":"Schaefer, T. J.: The complexity of satisfiability problems. Proc. 10th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, pp. 216\u2013226 (1978)."},{"key":"BF02684434_CR10","first-page":"155","volume":"11","author":"B. Smetaniuk","year":"1981","unstructured":"Smetaniuk, B.: A new construction on latin squares I. A proof of the Evans conjecture. Ars Combin.11, 155\u2013172 (1981).","journal-title":"Ars Combin."},{"key":"BF02684434_CR11","unstructured":"Tautenhahn, T., Woeginger, G. J.: Minimizing the total completion time in a unit time open shop with release times. Technical Report 291, TU Graz, 1994."},{"key":"BF02684434_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(91)90080-9","volume":"10","author":"D. Werra de","year":"1991","unstructured":"de Werra, D., Blazewicz, J., Kubiak, W.: A preemptive open shop scheduling problem with one resource. Oper. Res. Lett.10, 9\u201315 (1991).","journal-title":"Oper. Res. Lett."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684434.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684434\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:22:39Z","timestamp":1558218159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF02684434"],"URL":"https:\/\/doi.org\/10.1007\/bf02684434","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}