{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T13:01:51Z","timestamp":1713963711694},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T00:00:00Z","timestamp":1260921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10589-009-9311-0","type":"journal-article","created":{"date-parts":[[2009,12,15]],"date-time":"2009-12-15T17:25:14Z","timestamp":1260897914000},"page":"369-398","source":"Crossref","is-referenced-by-count":11,"title":["Scheduling with uncertainties on new computing platforms"],"prefix":"10.1007","volume":"48","author":[{"given":"Amine","family":"Mahjoub","sequence":"first","affiliation":[]},{"given":"Johnatan E.","family":"Pecero S\u00e1nchez","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,16]]},"reference":[{"key":"9311_CR1","unstructured":"Aloulou, M.A., Portmann, M.C.: Incorporating flexibility in job sequencing for the single machine total weighted tardiness problem with release dates. In: 10th Annual Industrial Engineering Research Conference, Dallas, Texas, USA, May 2001"},{"key":"9311_CR2","first-page":"112","volume":"6","author":"C. Artigues","year":"1999","unstructured":"Artigues, C., Roubellat, F., Billaut, J.-C.: Characterization of a set of schedules in a resource constrained multi-project scheduling problem with a multiple modes. Int. J. Ind. Eng. 6, 112\u2013122 (1999)","journal-title":"Int. J. Ind. Eng."},{"issue":"2","key":"9311_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I. Averbakh","year":"2001","unstructured":"Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. 90(2), 263\u2013272 (2001)","journal-title":"Math. Program."},{"issue":"6","key":"9311_CR4","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38(6), 1019\u20131033 (1990)","journal-title":"Oper. Res."},{"key":"9311_CR5","volume-title":"High Performance Cluster Computing: Architectures and Systems","year":"1999","unstructured":"Buyya, R. (ed.): High Performance Cluster Computing: Architectures and Systems, vol.\u00a01. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"9311_CR6","series-title":"Series in Automatic Computation","volume-title":"Operating Systems Theory","author":"E. Coffman","year":"1973","unstructured":"Coffman, E., Denning, P.: Operating Systems Theory. Series in Automatic Computation. Prentice-Hall, Englewood Cliffs (1973)"},{"key":"9311_CR7","volume-title":"Parallel Computer Architecture: A Hardware\/Software Approach","author":"D.E. Culler","year":"1999","unstructured":"Culler, D.E., Singh, J.P., Gupta, A.: Parallel Computer Architecture: A Hardware\/Software Approach. Morgan Kauffman, San Francisco (1999)"},{"issue":"2","key":"9311_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"R.L. Daniels","year":"1995","unstructured":"Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge againts processing time uncertainty in single-stage production. Manag. Sci. 41(2), 363\u2013376 (1995)","journal-title":"Manag. Sci."},{"key":"9311_CR9","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","year":"1999","unstructured":"Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure, vol.\u00a01. Morgan Kauffman, San Francisco (1999)"},{"key":"9311_CR10","unstructured":"Gaujal, B., Huard, G., Pecero, J., Thierry, E., Trystram, D.: Convex scheduling for grid computing. In: WASC 2004\u20141st Workshop on Algorithms for Scheduling and Communication, Bertinoro, Italy, 2004"},{"key":"9311_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-45346-6_22","volume-title":"3rd International Conference on Scale Scientific Computations","author":"C. Germain","year":"2001","unstructured":"Germain, C., Fedak, G., Neri, V., Cappello, F.: Global computing systems. In: 3rd International Conference on Scale Scientific Computations. LNCS, vol.\u00a02179, pp.\u00a0218\u2013227. Springer, Berlin (2001)"},{"key":"9311_CR12","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/66451.66454","volume":"32","author":"H. Gill","year":"1989","unstructured":"Gill, H., McCreary, C.: Automatic determination of grain size for efficient parallel processing. Commun. ACM 32, 1073\u20131078 (1989)","journal-title":"Commun. ACM"},{"key":"9311_CR13","volume-title":"Genetic Algorithms in Search, Optimization, Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, Machine Learning. Addison-Wesley, Boston (1989)"},{"issue":"1","key":"9311_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0167-8191(03)00091-7","volume":"30","author":"F. Guinand","year":"2004","unstructured":"Guinand, F., Moukrim, A., Sanlaville, E.: Sensitivity analysis of tree scheduling on two machines with communication delays. Parallel Comput. 30(1), 103\u2013120 (2004)","journal-title":"Parallel Comput."},{"key":"9311_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1051\/ro:2003018","volume":"37","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Parmentier, G., Trystram, D.: Scheduling precedence task graph with disturbances. RAIRO Oper. Res. 37, 145\u2013156 (2003)","journal-title":"RAIRO Oper. Res."},{"key":"9311_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/B:JOSH.0000013055.31639.f6","volume":"7","author":"N.G. Hall","year":"2004","unstructured":"Hall, N.G., Posner, M.E.: Sensitivity analysis for scheduling problems. J. Sched. 7, 49\u201383 (2004)","journal-title":"J. Sched."},{"key":"9311_CR17","unstructured":"Herroelen, W.S., Leus, R.: Project scheduling under uncertainty-survey and research potentials. In: Proceedings of the Eighth International Workshop on Project Management and Scheduling (PMS\u201902), Valencia, Spain, April 2002"},{"issue":"2","key":"9311_CR18","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J.J. Hwang","year":"1989","unstructured":"Hwang, J.J., Chow, Y.Ch., Angers, F.D., Lee, Ch.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18(2), 244\u2013257 (1989)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9311_CR19","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.orl.2004.07.004","volume":"33","author":"A. Kasperski","year":"2005","unstructured":"Kasperski, A.: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper. Res. Lett. 33(4), 431\u2013436 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"9311_CR20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S1383-7621(96)00022-7","volume":"42","author":"J.P. Kitajima","year":"1996","unstructured":"Kitajima, J.P., Plateau, B., Bouvry, P., Trystram, D.: Andes: Evaluating mapping strategies with synthetic programs. J. Syst. Archit. 42(5), 351\u2013365 (1996)","journal-title":"J. Syst. Archit."},{"key":"9311_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimisation and Its Applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimisation and Its Applications. Kluwer Academic, Dordrecht (1997)"},{"issue":"15","key":"9311_CR22","doi-asserted-by":"crossref","first-page":"2167","DOI":"10.1016\/j.dam.2005.04.015","volume":"154","author":"V. Labedev","year":"2006","unstructured":"Labedev, V., Averbakh, I.: Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Appl. Math. 154(15), 2167\u20132177 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9311_CR23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical Programming: The State of the Art (Bonn 1982)","author":"E. Lawler","year":"1983","unstructured":"Lawler, E.: Recent results in the theory of machine scheduling. In: Mathematical Programming: The State of the Art (Bonn 1982), pp.\u00a0202\u2013234. Springer, Berlin (1983)"},{"key":"9311_CR24","doi-asserted-by":"crossref","unstructured":"Lep\u00e9re, R., Trystram, D.: A new clustering algorithm for scheduling with large communication delays. In: 16th IEEE-ACM annual International Parallel, Distributed Processing Symposium (IPDPS\u201902), Fort Lauderdale, USA, April 2002","DOI":"10.1109\/IPDPS.2002.1015571"},{"issue":"2","key":"9311_CR25","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10852-006-9044-3","volume":"6","author":"R. Montemanni","year":"2007","unstructured":"Montemanni, R.: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data. J. Math. Model. Algorithms 6(2), 287\u2013296 (2007)","journal-title":"J. Math. Model. Algorithms"},{"key":"9311_CR26","unstructured":"Noguchi, S.: Task clustering for task schedule in parallel computing environments with large communication delays, Master Thesis, Masuzawa Lab., Japan (February 2004)"},{"issue":"2","key":"9311_CR27","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C.H. Papadimitriou","year":"1990","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Towards and architecture independent analysis of parallel algorithms. SIAM J. Comput. 19(2), 322\u2013328 (1990)","journal-title":"SIAM J. Comput."},{"key":"9311_CR28","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0377-2217(00)00281-2","volume":"127","author":"B. Penz","year":"2001","unstructured":"Penz, B., Rapine, C., Trystram, D.: Sensitivity analysis of scheduling algorithms. Eur. J. Oper. Res. 127, 606\u2013615 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9311_CR29","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","volume":"18","author":"V.J. Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.J.: UET scheduling with unit interprocessor communication delays. Discrete Appl. Math. 18, 55\u201371 (1987)","journal-title":"Discrete Appl. Math."},{"key":"9311_CR30","volume-title":"Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar, V.: Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, Cambridge (1989)"},{"key":"9311_CR31","unstructured":"Sgall, J.: On-line scheduling on parallel machines. PhD thesis, Carnegie-Mellon University, Pittsburgh, USA (1994)"},{"issue":"3","key":"9311_CR32","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"9311_CR33","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00582738","volume":"1","author":"P. Winkler","year":"1985","unstructured":"Winkler, P.: Random orders. Order 1, 317\u2013331 (1985)","journal-title":"Order"},{"key":"9311_CR34","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"Yang, T., Gerasoulis, A.: DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5, 951\u2013967 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"9311_CR35","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G. Yu","year":"1998","unstructured":"Yu, G., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25(6), 457\u2013468 (1998)","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9311-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9311-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9311-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:38Z","timestamp":1559302598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9311-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9311"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9311-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,16]]}}}