{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T05:49:41Z","timestamp":1769320181797,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642317231","type":"print"},{"value":"9783642317248","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31724-8_9","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T11:32:34Z","timestamp":1342870354000},"page":"74-83","source":"Crossref","is-referenced-by-count":8,"title":["Parallel Machine Scheduling under Uncertainty"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kasperski","sequence":"first","affiliation":[]},{"given":"Adam","family":"Kurpisz","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling on Parallel Machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"9_CR2","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)","edition":"5"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On Multi-dimensional Packing Problems. SIAM Journal on Computing\u00a033, 837\u2013851 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-Completeness Results: Motivation, Examples, and Implications. Journal of the ACM\u00a025, 499\u2013508 (1978)","journal-title":"Journal of the ACM"},{"key":"9_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"9_CR8","first-page":"421","volume":"32","author":"P. Kouvelis","year":"2000","unstructured":"Kouvelis, P., Daniels, R.L., Vairaktarakis, G.: Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions\u00a032, 421\u2013432 (2000)","journal-title":"IIE Transactions"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and its applications. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Rinnooy Kan, A., Brucker, P.: Complexity of Machine Scheduling Problems. In: Hammer, P., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.) Studies in Integer Programming, Annals of Discrete Mathematics, vol.\u00a01, pp. 343\u2013363. North-Holland Publishing Company (1977)","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"9_CR11","unstructured":"Luce, R., Raiffa, H.: Games and Decisions: Introduction and a Critical Survey. Wiley (1957)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S.K. Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for Scheduling Independent Tasks. Journal of the ACM\u00a023, 116\u2013127 (1976)","journal-title":"Journal of the ACM"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"R.R. Yager","year":"1988","unstructured":"Yager, R.R.: On Ordered Weighted Averaging Aggregation Operators in Multi-Criteria Decision Making. IEEE Transactions on Systems, Man and Cybernetics\u00a018, 183\u2013190 (1988)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theory of Computing\u00a03, 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31724-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:46:24Z","timestamp":1620114384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31724-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317231","9783642317248"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31724-8_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}