{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:26Z","timestamp":1725495746199},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_74","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:57:25Z","timestamp":1194980245000},"page":"878-889","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Lorant","family":"Porkolab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"key":"74_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the 5th European Symposium on Algorithms","author":"A.K. Amoura","year":"1997","unstructured":"A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th European Symposium on Algorithms (1997), LNCS 1284, 1\u201312."},{"key":"74_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF02057160","volume":"58","author":"L. Bianco","year":"1995","unstructured":"L. Bianco, J. Blazewicz, P. Dell Olmo and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58 (1995), 493\u2013517.","journal-title":"Annals of Operations Research"},{"key":"74_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","volume":"41","author":"J. Blazewicz","year":"1992","unstructured":"J. Blazewicz, P. Dell Olmo, M. Drozdowski and M. Speranza, Scheduling multiprocessor tasks on the three dedicated processors, Information Processing Letters 41 (1992), 275\u2013280.","journal-title":"Information Processing Letters"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics, in press.","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H"},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 418\u2013427.","DOI":"10.1145\/301250.301363"},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"M. Drozdowski, Scheduling multiprocessor tasks-an overview, European Journal on Operations Research, 94 (1996), 215\u2013230.","journal-title":"European Journal on Operations Research"},{"key":"74_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"J. Du and J. Leung, Complexity of scheduling parallel task systems, SI AM Journal on Discrete Mathematics, 2 (1989), 473\u2013487.","journal-title":"SI AM Journal on Discrete Mathematics"},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M.D. Grigoriadis","year":"1996","unstructured":"M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel pricedirective decomposition, Mathematics of Operations Research 21 (1996), 321\u2013340.","journal-title":"Mathematics of Operations Research"},{"key":"74_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J.A. Hoogeveen","year":"1994","unstructured":"J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"74_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/10719839_7","volume-title":"Proceedings of the 4th Latin American Theoretical Informatics","author":"K. Jansen","year":"2000","unstructured":"K. Jansen, M. Mastrolilli and R. Solis-Oba, Approximation algorithms for flexible job shop problems, Proceedings of the 4th Latin American Theoretical Informatics (2000), LNCS 1776, Springer Verlag, 68\u201377."},{"key":"74_CR11","unstructured":"K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (1999), 490\u2013498."},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 408\u2013417.","DOI":"10.1145\/301250.301361"},{"key":"74_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48447-7_13","volume-title":"Proceedings of the 6th International Workshop on Algorithms and Data Structures","author":"K. Jansen","year":"1999","unstructured":"K. Jansen and L. Porkolab, General multiprocessor task scheduling: approximate solution in linear time, Proceedings of the 6th International Workshop on Algorithms and Data Structures (1999), LNCS 1663, Springer Verlag, 110\u2013121."},{"key":"74_CR14","doi-asserted-by":"crossref","unstructured":"K. Jansen, R. Solis-Oba and M.I. Sviridenko, Makespan minimization in job shops: a polynomial time approximation scheme, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 394\u2013399.","DOI":"10.1145\/301250.301351"},{"key":"74_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-540-48413-4_19","volume-title":"Proceedings of the 2nd Workshop on Approximation Algorithms","author":"K. Jansen","year":"1999","unstructured":"K. Jansen, R. Solis-Oba and M.I. Sviridenko, A linear time approximation scheme for the job shop scheduling problem, Proceedings of the 2nd Workshop on Approximation Algorithms (1999), LNCS 1671, Springer Verlag, 177\u2013188."},{"key":"74_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E.L. Lawler","year":"1993","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: Handbook of Operations Research and Management Science, Vol. 4, North-Holland, 1993, 445\u2013522.","journal-title":"Handbook of Operations Research and Management Science"},{"key":"74_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"S.A. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research 20 (1995), 257\u2013301.","journal-title":"Mathematics of Operations Research"},{"key":"74_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D.B. Shmoys","year":"1994","unstructured":"D.B. Shmoys, C. Stein and J. Wein, Improved approximation algorithms for shop scheduling problems, SI AM Journal on Computing, 23 (1994), 617\u2013632.","journal-title":"SI AM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:25:42Z","timestamp":1556954742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}