{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:38:29Z","timestamp":1764783509245},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,22]],"date-time":"2013-05-22T00:00:00Z","timestamp":1369180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s11590-013-0655-0","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T05:26:27Z","timestamp":1369113987000},"page":"1577-1589","source":"Crossref","is-referenced-by-count":13,"title":["A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines"],"prefix":"10.1007","volume":"8","author":[{"given":"Eduardo","family":"Conde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,22]]},"reference":[{"issue":"6","key":"655_CR1","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","volume":"33","author":"H Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6), 634\u2013640 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"655_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427\u2013438 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"655_CR3","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1109\/TPWRS.2010.2042310","volume":"25","author":"JM Arroyo","year":"2010","unstructured":"Arroyo, J.M., Alguacil, N., Carri\u00f3n, M.: A risk-based approach for transmission network expansion planning under deliberate outages. IEEE Trans. Power Syst. 25(3), 1759\u20131766 (2010)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"655_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2003.08.027","volume":"161","author":"H Aytug","year":"2005","unstructured":"Aytug, H., Lawley, M.A., McKay, K., Mohan, S., Uzsoy, R.: Executing production schedules in the face of uncertainties: a review and some future directions. Eur. J. Oper. Res. 161(1), 86\u2013110 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"655_CR5","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"655_CR6","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.orl.2010.03.002","volume":"38","author":"E Conde","year":"2010","unstructured":"Conde, E.: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. Oper. Res. Lett. 38, 326\u2013327 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"655_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"RL Daniels","year":"1995","unstructured":"Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manage. Sci. 41(2), 363\u2013376 (1995)","journal-title":"Manage. Sci."},{"key":"655_CR8","unstructured":"Herroelen, W., Leus, R.: Project scheduling under uncertainty: survey and research potentials. Eur. J. Oper. Res. 165(2), 289\u2013306 (2005)"},{"issue":"1","key":"655_CR9","first-page":"47","volume":"1","author":"Holmstr\u00f6m Kenneth","year":"1999","unstructured":"Kenneth, Holmstr\u00f6m: The TOMLAB Optimization Environment in Matlab. Adv. Model. Optim. 1(1), 47\u201369 (1999)","journal-title":"Adv. Model. Optim."},{"issue":"3","key":"655_CR10","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"WA Horn","year":"1973","unstructured":"Horn, W.A.: Minimizing average flow time with parallel machines. Operat. Res. 21(3), 846\u2013847 (1973)","journal-title":"Operat. Res."},{"key":"655_CR11","volume-title":"Discrete optimization with interval data, Minmax regret and fuzzy approach. Studies in Fuzziness and Soft Computing","author":"A Kasperski","year":"2008","unstructured":"Kasperski, A.: Discrete optimization with interval data, Minmax regret and fuzzy approach. Studies in Fuzziness and Soft Computing. Springer, New York (2008)"},{"issue":"1","key":"655_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1), 36\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"655_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.orl.2007.11.004","volume":"36","author":"A Kasperski","year":"2008","unstructured":"Kasperski, A., Zieli\u0144ski, P.: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. Oper. Res. Lett. 36(3), 343\u2013344 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"655_CR14","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TFUZZ.2011.2159982","volume":"19","author":"A Kasperski","year":"2011","unstructured":"Kasperski, A., Zieli\u0144ski, P.: Possibilistic minmax regret sequencing problems with fuzzy parameters. IEEE Trans. Fuzzy Syst. 19(6), 1072\u20131082 (2011)","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"5","key":"655_CR15","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 Trans. 32(5), 421\u2013432 (2000). (Institute of Industrial Engineers)","journal-title":"IIE Trans."},{"key":"655_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publisher, USA (1997)"},{"key":"655_CR17","doi-asserted-by":"crossref","unstructured":"Lai, T.-C., Sotskov, YuN: Sequencing with uncertain numerical data for makespan minimisation. J. Oper. Res. Soc. 50(2\u20133), 230\u2013243 (1999)","DOI":"10.1057\/palgrave.jors.2600690"},{"issue":"3","key":"655_CR18","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/S0377-2217(03)00424-7","volume":"159","author":"T-C Lai","year":"2004","unstructured":"Lai, T.-C., Sotskov, YuN, Sotskova, N., Werner, F.: Mean flow time minimization with given bounds of processing times. Eur. J. Oper. Res. 159(3), 558\u2013573 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"655_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0895-7177(97)00132-5","volume":"26","author":"T-C Lai","year":"1997","unstructured":"Lai, T.-C., Sotskov, YuN, Werner, F.: Optimal makespan scheduling with given bounds of processing times. Math. Comput. Model. 26(3), 67\u201386 (1997)","journal-title":"Math. Comput. Model."},{"issue":"15","key":"655_CR20","doi-asserted-by":"crossref","first-page":"2167","DOI":"10.1016\/j.dam.2005.04.015","volume":"154","author":"V Lebedev","year":"2006","unstructured":"Lebedev, 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."},{"issue":"2","key":"655_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.ejor.2011.01.053","volume":"212","author":"J Lin","year":"2011","unstructured":"Lin, J., Ng, T.S.: Robust multi-market newsvendor models with interval demand data. Eur. J. Oper. Res. 212(2), 361\u2013373 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"655_CR22","doi-asserted-by":"crossref","first-page":"1682","DOI":"10.1016\/j.cor.2011.10.003","volume":"39","author":"C-C Lu","year":"2012","unstructured":"Lu, C.-C., Lin, S.-W., Ying, K.-C.: Robust scheduling on a single machine to minimize total flow time. Comput. Oper. Res. 39(7), 1682\u20131691 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"655_CR23","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10589-009-9311-0","volume":"48","author":"A Mahjoub","year":"2011","unstructured":"Mahjoub, A., Pecero S\u00e1nchez, J.E.: Scheduling with uncertainties on new computing platforms. Comput. Optim. Appl. 48(2), 369\u2013398 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"655_CR24","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/59.667394","volume":"13","author":"V Miranda","year":"1998","unstructured":"Miranda, V., Proenca, L.M.: Why risk analysis outperforms probabilistic choice as the effective decision support paradigm for power system planning. IEEE Trans. Power Syst. 13(2), 643\u2013648 (1998)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"655_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"},{"issue":"3","key":"655_CR26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"SH Owen","year":"1998","unstructured":"Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111(3), 423\u2013447 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"655_CR27","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.cor.2010.11.009","volume":"38","author":"J Pereira","year":"2011","unstructured":"Pereira, J., Averbakh, I.: Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38(8), 1153\u20131163 (2011)","journal-title":"Comput. Oper. Res."},{"key":"655_CR28","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2010","unstructured":"Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer, New York (2010)"},{"key":"655_CR29","doi-asserted-by":"crossref","unstructured":"Siepak, M., J\u00f3zefczyk, J.: Minmax regret algorithms for uncertain P||Cmax problem with interval processing times. Proceedings of ICSEng 2011: international conference on systems engineering, pp. 115\u2013119 (2011)","DOI":"10.1109\/ICSEng.2011.28"},{"issue":"7","key":"655_CR30","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547\u2013564 (2006). (Institute of Industrial Engineers)","journal-title":"IIE Trans."},{"key":"655_CR31","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.mcm.2009.03.006","volume":"50","author":"YuN Sotskov","year":"2009","unstructured":"Sotskov, YuN, Egorova, N.G., Lai, T.-C.: Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model. 50, 556\u2013573 (2009)","journal-title":"Math. Comput. Model."},{"issue":"1","key":"655_CR32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1013333232691","volume":"6","author":"J Yang","year":"2002","unstructured":"Yang, J., Yu, G.: On the robust single machine scheduling problem. J. Comb. Optim. 6(1), 17\u201333 (2002)","journal-title":"J. Comb. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0655-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0655-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0655-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T00:18:28Z","timestamp":1563063508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0655-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,22]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["655"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0655-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,22]]}}}