{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:36:24Z","timestamp":1773326184931,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T00:00:00Z","timestamp":1195084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10951-007-0050-8","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T15:15:50Z","timestamp":1195053350000},"page":"75-83","source":"Crossref","is-referenced-by-count":11,"title":["Preemptive open shop scheduling with multiprocessors: polynomial cases and applications"],"prefix":"10.1007","volume":"11","author":[{"given":"Dominique","family":"de Werra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,15]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/S0377-2217(01)00342-3","volume":"143","author":"A. S. Asratian","year":"2002","unstructured":"Asratian, A. S., & de Werra, D. (2002). A generalized class-teacher model for some timetabling problems. European Journal of Operational Research, 143, 531\u2013542.","journal-title":"European Journal of Operational Research"},{"key":"50_CR2","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C. (1973). Graphs and hypergraphs. Amsterdam: North-Holland."},{"issue":"5","key":"50_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"35","author":"J. B\u0142a\u017cewicz","year":"1986","unstructured":"B\u0142a\u017cewicz, J., Drabowski, M., & Weglarz, J. (1986). Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers, 35(5), 389\u2013393.","journal-title":"IEEE Transactions on Computers"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","volume":"41","author":"J. B\u0142a\u017cewicz","year":"1992","unstructured":"B\u0142a\u017cewicz, J., Dell\u2019Olmo, P., Drozdowski, M., & Speranza, M. G. (1992). Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters, 41, 275\u2013280.","journal-title":"Information Processing Letters"},{"key":"50_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. B\u0142a\u017cewicz","year":"1996","unstructured":"B\u0142a\u017cewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (1996). Scheduling computer and manufacturing processes. Berlin: Springer."},{"key":"50_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02099688","volume":"57","author":"P. Brucker","year":"1995","unstructured":"Brucker, P., & Kr\u00e4mer, A. (1995). Shop scheduling problems with multiprocessor tasks on dedicated processors. Annals of Operations Research, 57, 13\u201327.","journal-title":"Annals of Operations Research"},{"key":"50_CR7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P. Brucker","year":"1996","unstructured":"Brucker, P., & Kr\u00e4mer, A. (1996). Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research, 90, 214\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"50_CR8","series-title":"Applications to timetabling","first-page":"445","volume-title":"Handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kingston, J. H., & De Werra, D. (2004). In J. Gross & J. Yellen (Eds.), Handbook of graph theory, Applications to timetabling (pp.\u00a0445\u2013474). London\/Boca Raton: Chapman Hall\/CRC Press."},{"key":"50_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19, 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"50_CR10","unstructured":"de Werra, D., & Kis, T. (2001). Some solvable cases of preemptive open shop scheduling with multiprocessors. ORWP 01\/07, Department of Mathematics, Lausanne: Swiss Federal Institute of Technology."},{"key":"50_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/jos.97","volume":"5","author":"D. Werra de","year":"2002","unstructured":"de Werra, D., Asratian, A. S., & Durand, S. (2002). Complexity of some special types of timetabling problems. Journal of Scheduling, 5, 171\u2013183.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"50_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"Drozdowski, M. (1996). Scheduling multiprocessor tasks\u2014an overview. European Journal of Operational Research, 94(2), 215\u2013230.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"50_CR13","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., & Leung, J. Y.-T. (1989). Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics, 2(4), 473\u2013487.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"50_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","volume":"11","author":"H. N. Gabow","year":"1982","unstructured":"Gabow, H. N., & Kariv, O. (1982). Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal on Computing, 11(1), 117\u2013129.","journal-title":"SIAM Journal on Computing"},{"key":"50_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman."},{"issue":"4","key":"50_CR16","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23(4), 665\u2013679.","journal-title":"Journal of the ACM"},{"key":"50_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J. A. Hoogeveen","year":"1994","unstructured":"Hoogeveen, J. A., van de Velde, S. L., & Veltman, B. (1994). Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics, 55, 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"50_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/B:JOSH.0000013054.30334.b9","volume":"7","author":"K. Jansen","year":"2004","unstructured":"Jansen, K., & Porkolab, L. (2004). Preemptive scheduling with dedicated processors: applications of fractional graph coloring. Journal of Scheduling, 7(1), 35\u201348.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"50_CR19","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/0377-2217(96)00131-2","volume":"94","author":"M. Kubale","year":"1996","unstructured":"Kubale, M. (1996). Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research, 94(2), 242\u2013251.","journal-title":"European Journal of Operational Research"},{"key":"50_CR20","series-title":"University timetabling","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. K. (2004). In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. University timetabling. Boca Raton: CRC Press, Chapter 45."},{"key":"50_CR21","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"Tardos, \u00c9. (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34, 362\u2013370.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0050-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0050-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0050-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:40Z","timestamp":1559453980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0050-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,15]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0050-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,15]]}}}