Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
•Distributionally robust solution to total flow time minimization on parallel machines.•Reformulation of the problem in terms of norm regularization.•Complexity characterization with respect to the type of the used norm.•The results show that it is possible to achieve similar stability/quality trade...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 302; H. 2; S. 438 - 455 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.10.2022
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •Distributionally robust solution to total flow time minimization on parallel machines.•Reformulation of the problem in terms of norm regularization.•Complexity characterization with respect to the type of the used norm.•The results show that it is possible to achieve similar stability/quality trade-offs with much-reduced computation cost when the l1 norm is used.
In this paper, we study a distributionally robust parallel machines scheduling problem, minimizing the total flow time criterion. The distribution of uncertain processing times is subject to ambiguity belonging to a set of distributions with constrained mean and covariance. We show that the problem can be cast as a deterministic optimization problem, with the objective function composed of an expectation and a regularization term given as an ℓp norm. The main question we ask and answer is whether the particular choice of the used ℓp norm affects the computational complexity of the problem and the robustness of its solution. We prove that if durations of the jobs are independent, the solution in terms of any ℓp norm can be solved in a pseudopolynomial time, by the reduction to a non-linear bipartite matching problem. We also show an efficient, polynomial-time algorithm for ℓ1 case. Furthermore, for instances with dependent durations of the jobs, we propose computationally efficient formulation and an algorithm that uses ℓ1 norm. Moreover, we identify a class of covariance matrices admitting a faster, polynomial-time algorithm. The computational experiments show that the proposed algorithms provide solutions with a similar quality to the existing algorithms while having significantly better computational complexities. |
|---|---|
| AbstractList | •Distributionally robust solution to total flow time minimization on parallel machines.•Reformulation of the problem in terms of norm regularization.•Complexity characterization with respect to the type of the used norm.•The results show that it is possible to achieve similar stability/quality trade-offs with much-reduced computation cost when the l1 norm is used.
In this paper, we study a distributionally robust parallel machines scheduling problem, minimizing the total flow time criterion. The distribution of uncertain processing times is subject to ambiguity belonging to a set of distributions with constrained mean and covariance. We show that the problem can be cast as a deterministic optimization problem, with the objective function composed of an expectation and a regularization term given as an ℓp norm. The main question we ask and answer is whether the particular choice of the used ℓp norm affects the computational complexity of the problem and the robustness of its solution. We prove that if durations of the jobs are independent, the solution in terms of any ℓp norm can be solved in a pseudopolynomial time, by the reduction to a non-linear bipartite matching problem. We also show an efficient, polynomial-time algorithm for ℓ1 case. Furthermore, for instances with dependent durations of the jobs, we propose computationally efficient formulation and an algorithm that uses ℓ1 norm. Moreover, we identify a class of covariance matrices admitting a faster, polynomial-time algorithm. The computational experiments show that the proposed algorithms provide solutions with a similar quality to the existing algorithms while having significantly better computational complexities. |
| Author | Novak, Antonin Gnatowski, Andrzej Sucha, Premysl |
| Author_xml | – sequence: 1 givenname: Antonin orcidid: 0000-0003-2203-4554 surname: Novak fullname: Novak, Antonin email: antonin.novak@cvut.cz organization: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Czechia – sequence: 2 givenname: Andrzej orcidid: 0000-0001-5468-8005 surname: Gnatowski fullname: Gnatowski, Andrzej organization: Department of Control Systems and Mechatronics, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Poland – sequence: 3 givenname: Premysl orcidid: 0000-0003-4895-157X surname: Sucha fullname: Sucha, Premysl organization: Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Czechia |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU_5A7tOst3dFrxI_QTBi55Dmo92SnZTkqxSD_52d21PHgoD88LM8zLzTsio9a0h5JpBzoBVN9vcbH3IOXCeA8sB-BkZs3nNs2pewYiMoajrjHNWX5BJjFsAYCUrx-TnHmMKuOoS-lY6t6fBr7qYaFQbozuH7ZpKt_YB06aJ1PpAk0_SUev8F03YGNpgiw1-y8GB9rWToTcyjjZSbbA1kXZxsGl9aGgw687JcFyPl-TcShfN1bFPycfjw_vyOXt9e3pZ3r1mqiiKlMmi0orrGVRmLllpQbGFVnY1W8yYlbbq51ZpU5azXpQgNUi-WDAOoHsh62JK5gdfFXyMwVihMP2dkIJEJxiIIUexFUOOYshRABN9jj3K_6G7gI0M-9PQ7QEy_VOfaIKICk2rjMZgVBLa4yn8F7mYk7Y |
| CitedBy_id | crossref_primary_10_1016_j_cor_2024_106776 crossref_primary_10_1016_j_ejor_2025_04_037 crossref_primary_10_1016_j_omega_2023_102896 crossref_primary_10_1109_TASE_2023_3246223 crossref_primary_10_1007_s10479_023_05489_x crossref_primary_10_1016_j_ejor_2025_04_053 crossref_primary_10_1016_j_ejor_2023_07_011 crossref_primary_10_1111_itor_13325 crossref_primary_10_1016_j_ejor_2022_11_005 crossref_primary_10_1016_j_cie_2024_110282 crossref_primary_10_1177_18479790241301164 |
| Cites_doi | 10.1007/BF00940344 10.1016/j.disopt.2007.11.002 10.1016/j.cor.2011.10.003 10.1016/j.ejor.2018.08.037 10.1016/j.ejor.2018.07.007 10.1007/s10287-015-0240-3 10.1007/s10107-017-1125-8 10.1016/j.cie.2015.12.024 10.1016/j.ejor.2018.11.039 10.1016/j.jmva.2011.06.017 10.1016/j.jcss.2006.10.018 10.1016/j.laa.2006.05.004 10.1016/j.compchemeng.2017.12.002 10.1137/S1052623497327088 10.1137/1.9781611975482.110 10.1007/s11047-018-9685-y 10.1007/s10107-011-0470-2 10.1137/130915315 10.1016/j.ejor.2019.11.039 10.1007/BF02278710 10.1016/j.cor.2018.08.007 10.2307/3212616 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2022.01.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 455 |
| ExternalDocumentID | 10_1016_j_ejor_2022_01_002 S0377221722000029 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c333t-a36dc2d406e8a15f0c19dcfb4941faf6a36fcde55436f50ad0a2991200da29a73 |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000829764400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 22:12:17 EST 2025 Sat Nov 29 07:20:27 EST 2025 Fri Feb 23 02:41:19 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Total flow time Scheduling Uncertain processing time Computational complexity Distributionally robust optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c333t-a36dc2d406e8a15f0c19dcfb4941faf6a36fcde55436f50ad0a2991200da29a73 |
| ORCID | 0000-0001-5468-8005 0000-0003-4895-157X 0000-0003-2203-4554 |
| PageCount | 18 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2022_01_002 crossref_primary_10_1016_j_ejor_2022_01_002 elsevier_sciencedirect_doi_10_1016_j_ejor_2022_01_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-10-16 |
| PublicationDateYYYYMMDD | 2022-10-16 |
| PublicationDate_xml | – month: 10 year: 2022 text: 2022-10-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Xue, Ye (bib0038) 2000; 10 Shapiro (bib0030) 2001 Berstein, Onn (bib0005) 2008; 5 Leonardi, Raz (bib0020) 2007; 73 Balakrishnan, Scarpa (bib0002) 2012; 104 Sohler, Woodruff (bib0034) 2011 Chang, Ding, Song (bib0008) 2019; 272 Delage (bib0012) 2009 Jonker, Volgenant (bib0017) 1987; 38 Gambella, Ghaddar, Naoum-Sawaya (bib0014) 2020 oblivious subspace embeddings. Mangasarian, Meyer (bib0024) 2006; 419 Ben-Tal, Hochman (bib0004) 1972; 9 Brucker (bib0007) 2007 Scarf (bib0028) 1958 Lu, Lin, Ying (bib0021) 2012; 39 Ge, Jiang, Ye (bib0015) 2011; 129 Bayraksan, Love (bib0003) 2015 Majumdar, S. N., & Pal, A. (2014). Extreme value statistics of correlated random variables. Murphy (bib0025) 2012 Shapiro, Nemirovski (bib0031) 2005 Alimoradi, Hematian, Moslehi (bib0001) 2016; 93 Emmerich, Deutz (bib0013) 2018; 17 Mangasarian, Meyer (bib0023) 2006; 419 Indyk (bib0016) 2000 Rahimian, H., & Mehrotra, S. (2019). Distributionally robust optimization: A review. Kramer, Dell’Amico, Iori (bib0019) 2019; 275 . Shang, You (bib0029) 2018; 110 Wang, Glynn, Ye (bib0037) 2016; 13 Bertsimas, Gupta, Kallus (bib0006) 2018; 167 Charikar, Sahai (bib0009) 2002 Wang, R., & Woodruff, D. P. (2018). Tight bounds for Chung (bib0011) 1989; 60 Wang, Zhang, Tang (bib0036) 2019; 273 Niu, Song, Ding, Zhang, Chiong (bib0026) 2019; 101 Kotz, Kozubowski, Podgórski (bib0018) 2001 Sneha, Malle (bib0033) 2017 Cheng, Delage, Lisser (bib0010) 2014; 24 Shehadeh, Cohn, Jiang (bib0032) 2020; 283 Delage (10.1016/j.ejor.2022.01.002_bib0012) 2009 Niu (10.1016/j.ejor.2022.01.002_bib0026) 2019; 101 Alimoradi (10.1016/j.ejor.2022.01.002_bib0001) 2016; 93 Shapiro (10.1016/j.ejor.2022.01.002_bib0030) 2001 Lu (10.1016/j.ejor.2022.01.002_bib0021) 2012; 39 Mangasarian (10.1016/j.ejor.2022.01.002_bib0023) 2006; 419 Xue (10.1016/j.ejor.2022.01.002_bib0038) 2000; 10 Ben-Tal (10.1016/j.ejor.2022.01.002_bib0004) 1972; 9 Shehadeh (10.1016/j.ejor.2022.01.002_bib0032) 2020; 283 Jonker (10.1016/j.ejor.2022.01.002_bib0017) 1987; 38 Emmerich (10.1016/j.ejor.2022.01.002_bib0013) 2018; 17 Chung (10.1016/j.ejor.2022.01.002_bib0011) 1989; 60 Wang (10.1016/j.ejor.2022.01.002_bib0037) 2016; 13 Bayraksan (10.1016/j.ejor.2022.01.002_bib0003) 2015 Cheng (10.1016/j.ejor.2022.01.002_bib0010) 2014; 24 10.1016/j.ejor.2022.01.002_bib0035 Kramer (10.1016/j.ejor.2022.01.002_bib0019) 2019; 275 Shang (10.1016/j.ejor.2022.01.002_bib0029) 2018; 110 Mangasarian (10.1016/j.ejor.2022.01.002_bib0024) 2006; 419 10.1016/j.ejor.2022.01.002_bib0027 Leonardi (10.1016/j.ejor.2022.01.002_bib0020) 2007; 73 Brucker (10.1016/j.ejor.2022.01.002_bib0007) 2007 Ge (10.1016/j.ejor.2022.01.002_bib0015) 2011; 129 Sohler (10.1016/j.ejor.2022.01.002_bib0034) 2011 Sneha (10.1016/j.ejor.2022.01.002_bib0033) 2017 Wang (10.1016/j.ejor.2022.01.002_bib0036) 2019; 273 Balakrishnan (10.1016/j.ejor.2022.01.002_sbref0002) 2012; 104 Gambella (10.1016/j.ejor.2022.01.002_bib0014) 2020 Kotz (10.1016/j.ejor.2022.01.002_bib0018) 2001 Bertsimas (10.1016/j.ejor.2022.01.002_bib0006) 2018; 167 Charikar (10.1016/j.ejor.2022.01.002_bib0009) 2002 Indyk (10.1016/j.ejor.2022.01.002_bib0016) 2000 Chang (10.1016/j.ejor.2022.01.002_bib0008) 2019; 272 10.1016/j.ejor.2022.01.002_bib0022 Scarf (10.1016/j.ejor.2022.01.002_bib0028) 1958 Berstein (10.1016/j.ejor.2022.01.002_bib0005) 2008; 5 Shapiro (10.1016/j.ejor.2022.01.002_bib0031) 2005 Murphy (10.1016/j.ejor.2022.01.002_bib0025) 2012 |
| References_xml | – volume: 24 start-page: 1485 year: 2014 end-page: 1506 ident: bib0010 article-title: Distributionally robust stochastic knapsack problem publication-title: SIAM Journal on Optimization – year: 2009 ident: bib0012 article-title: Distributionally robust optimization in context of data-driven problems – reference: Rahimian, H., & Mehrotra, S. (2019). Distributionally robust optimization: A review. – volume: 101 start-page: 13 year: 2019 end-page: 28 ident: bib0026 article-title: Distributionally robust single machine scheduling with the total tardiness criterion publication-title: Computers & Operations Research – volume: 419 start-page: 359 year: 2006 end-page: 367 ident: bib0023 article-title: Absolute value equations publication-title: Linear Algebra and its Applications – start-page: 1 year: 2015 end-page: 19 ident: bib0003 article-title: Data-driven stochastic programming using phi-divergences publication-title: The operations research revolution – volume: 283 start-page: 549 year: 2020 end-page: 561 ident: bib0032 article-title: A distributionally robust optimization approach for outpatient colonoscopy scheduling publication-title: European Journal of Operational Research – year: 1958 ident: bib0028 article-title: A min-max solution of an inventory problem publication-title: Studies in the Mathematical Theory of Inventory and Production – volume: 93 start-page: 152 year: 2016 end-page: 161 ident: bib0001 article-title: Robust scheduling of parallel machines considering total flow time publication-title: Computers & Industrial Engineering – volume: 9 start-page: 803 year: 1972 end-page: 812 ident: bib0004 article-title: More bounds on the expectation of a convex function of a random variable publication-title: Journal of Applied Probability – year: 2012 ident: bib0025 article-title: Machine learning: A probabilistic perspective – volume: 273 start-page: 740 year: 2019 end-page: 753 ident: bib0036 article-title: A distributionally robust optimization approach for surgery block allocation publication-title: European Journal of Operational Research – start-page: 755 year: 2011 end-page: 764 ident: bib0034 article-title: Subspace embeddings for the l1-norm with applications publication-title: Proceedings of the forty-third annual ACM symposium on theory of computing – volume: 10 start-page: 551 year: 2000 end-page: 579 ident: bib0038 article-title: An efficient algorithm for minimizing a sum of p-norms publication-title: SIAM Journal on Optimization – start-page: 77 year: 2017 end-page: 81 ident: bib0033 article-title: Research on software testing techniques and software automation testing tools publication-title: 2017 International conference on energy, communication, data analytics and soft computing (ICECDS) – start-page: 239 year: 2001 end-page: 272 ident: bib0018 article-title: Asymmetric multivariate Laplace distribution publication-title: The laplace distribution and generalizations – volume: 110 start-page: 53 year: 2018 end-page: 68 ident: bib0029 article-title: Distributionally robust optimization for planning and scheduling under uncertainty publication-title: Computers & Chemical Engineering – year: 2020 ident: bib0014 article-title: Optimization problems for machine learning: A survey publication-title: European Journal of Operational Research – volume: 39 start-page: 1682 year: 2012 end-page: 1691 ident: bib0021 article-title: Robust scheduling on a single machine to minimize total flow time publication-title: Computers & Operations Research – reference: oblivious subspace embeddings. – volume: 272 start-page: 832 year: 2019 end-page: 846 ident: bib0008 article-title: Distributionally robust scheduling on parallel machines under moment uncertainty publication-title: European Journal of Operational Research – start-page: 189 year: 2000 end-page: 197 ident: bib0016 article-title: Stable distributions, pseudorandom generators, embeddings and data stream computation publication-title: Proceedings 41st annual symposium on foundations of computer science – volume: 167 start-page: 235 year: 2018 end-page: 292 ident: bib0006 article-title: Data-driven robust optimization publication-title: Mathematical Programming – volume: 73 start-page: 875 year: 2007 end-page: 891 ident: bib0020 article-title: Approximating total flow time on parallel machines publication-title: Journal of Computer and System Sciences – volume: 275 start-page: 67 year: 2019 end-page: 79 ident: bib0019 article-title: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines publication-title: European Journal of Operational Research – volume: 38 start-page: 325 year: 1987 end-page: 340 ident: bib0017 article-title: A shortest augmenting path algorithm for dense and sparse linear assignment problems publication-title: Computing – start-page: 135 year: 2001 end-page: 165 ident: bib0030 article-title: On duality theory of conic linear problems – reference: . – start-page: 111 year: 2005 end-page: 146 ident: bib0031 article-title: On complexity of stochastic programming problems publication-title: Continuous optimization – volume: 5 start-page: 53 year: 2008 end-page: 65 ident: bib0005 article-title: Nonlinear bipartite matching publication-title: Discrete Optimization – volume: 17 start-page: 585 year: 2018 end-page: 609 ident: bib0013 article-title: A tutorial on multiobjective optimization: Fundamentals and evolutionary methods publication-title: Natural Computing – reference: Majumdar, S. N., & Pal, A. (2014). Extreme value statistics of correlated random variables. – volume: 419 start-page: 359 year: 2006 end-page: 367 ident: bib0024 article-title: Absolute value equations publication-title: Linear Algebra and its Applications – volume: 60 start-page: 393 year: 1989 end-page: 399 ident: bib0011 article-title: NP-completeness of the linear complementarity problem publication-title: Journal of Optimization Theory and Applications – year: 2007 ident: bib0007 article-title: Scheduling Algorithms – volume: 104 start-page: 73 year: 2012 end-page: 87 ident: bib0002 article-title: Multivariate measures of skewness for the skew-normal distribution publication-title: Journal of Multivariate Analysis – reference: Wang, R., & Woodruff, D. P. (2018). Tight bounds for – start-page: 551 year: 2002 end-page: 560 ident: bib0009 article-title: Dimension reduction in the publication-title: The 43rd annual IEEE symposium on foundations of computer science, 2002. Proc. – volume: 129 start-page: 285 year: 2011 end-page: 299 ident: bib0015 article-title: A note on the complexity of publication-title: Mathematical Programming – volume: 13 start-page: 241 year: 2016 end-page: 261 ident: bib0037 article-title: Likelihood robust optimization for data-driven problems publication-title: Computational Management Science – start-page: 239 year: 2001 ident: 10.1016/j.ejor.2022.01.002_bib0018 article-title: Asymmetric multivariate Laplace distribution – start-page: 111 year: 2005 ident: 10.1016/j.ejor.2022.01.002_bib0031 article-title: On complexity of stochastic programming problems – volume: 60 start-page: 393 issue: 3 year: 1989 ident: 10.1016/j.ejor.2022.01.002_bib0011 article-title: NP-completeness of the linear complementarity problem publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00940344 – volume: 5 start-page: 53 issue: 1 year: 2008 ident: 10.1016/j.ejor.2022.01.002_bib0005 article-title: Nonlinear bipartite matching publication-title: Discrete Optimization doi: 10.1016/j.disopt.2007.11.002 – year: 2007 ident: 10.1016/j.ejor.2022.01.002_bib0007 – volume: 39 start-page: 1682 issue: 7 year: 2012 ident: 10.1016/j.ejor.2022.01.002_bib0021 article-title: Robust scheduling on a single machine to minimize total flow time publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.10.003 – volume: 273 start-page: 740 issue: 2 year: 2019 ident: 10.1016/j.ejor.2022.01.002_bib0036 article-title: A distributionally robust optimization approach for surgery block allocation publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.08.037 – volume: 272 start-page: 832 issue: 3 year: 2019 ident: 10.1016/j.ejor.2022.01.002_bib0008 article-title: Distributionally robust scheduling on parallel machines under moment uncertainty publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.07.007 – start-page: 1 year: 2015 ident: 10.1016/j.ejor.2022.01.002_bib0003 article-title: Data-driven stochastic programming using phi-divergences – volume: 13 start-page: 241 issue: 2 year: 2016 ident: 10.1016/j.ejor.2022.01.002_bib0037 article-title: Likelihood robust optimization for data-driven problems publication-title: Computational Management Science doi: 10.1007/s10287-015-0240-3 – volume: 167 start-page: 235 issue: 2 year: 2018 ident: 10.1016/j.ejor.2022.01.002_bib0006 article-title: Data-driven robust optimization publication-title: Mathematical Programming doi: 10.1007/s10107-017-1125-8 – volume: 93 start-page: 152 year: 2016 ident: 10.1016/j.ejor.2022.01.002_bib0001 article-title: Robust scheduling of parallel machines considering total flow time publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2015.12.024 – volume: 275 start-page: 67 issue: 1 year: 2019 ident: 10.1016/j.ejor.2022.01.002_bib0019 article-title: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.11.039 – year: 2012 ident: 10.1016/j.ejor.2022.01.002_bib0025 – volume: 104 start-page: 73 issue: 1 year: 2012 ident: 10.1016/j.ejor.2022.01.002_sbref0002 article-title: Multivariate measures of skewness for the skew-normal distribution publication-title: Journal of Multivariate Analysis doi: 10.1016/j.jmva.2011.06.017 – year: 1958 ident: 10.1016/j.ejor.2022.01.002_bib0028 article-title: A min-max solution of an inventory problem publication-title: Studies in the Mathematical Theory of Inventory and Production – volume: 73 start-page: 875 issue: 6 year: 2007 ident: 10.1016/j.ejor.2022.01.002_bib0020 article-title: Approximating total flow time on parallel machines publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2006.10.018 – volume: 419 start-page: 359 issue: 2-3 year: 2006 ident: 10.1016/j.ejor.2022.01.002_bib0023 article-title: Absolute value equations publication-title: Linear Algebra and its Applications doi: 10.1016/j.laa.2006.05.004 – volume: 110 start-page: 53 year: 2018 ident: 10.1016/j.ejor.2022.01.002_bib0029 article-title: Distributionally robust optimization for planning and scheduling under uncertainty publication-title: Computers & Chemical Engineering doi: 10.1016/j.compchemeng.2017.12.002 – volume: 10 start-page: 551 issue: 2 year: 2000 ident: 10.1016/j.ejor.2022.01.002_bib0038 article-title: An efficient algorithm for minimizing a sum of p-norms publication-title: SIAM Journal on Optimization doi: 10.1137/S1052623497327088 – start-page: 77 year: 2017 ident: 10.1016/j.ejor.2022.01.002_bib0033 article-title: Research on software testing techniques and software automation testing tools – year: 2009 ident: 10.1016/j.ejor.2022.01.002_bib0012 – start-page: 189 year: 2000 ident: 10.1016/j.ejor.2022.01.002_bib0016 article-title: Stable distributions, pseudorandom generators, embeddings and data stream computation – start-page: 551 year: 2002 ident: 10.1016/j.ejor.2022.01.002_bib0009 article-title: Dimension reduction in the ℓ1 norm – ident: 10.1016/j.ejor.2022.01.002_bib0035 doi: 10.1137/1.9781611975482.110 – volume: 17 start-page: 585 issue: 3 year: 2018 ident: 10.1016/j.ejor.2022.01.002_bib0013 article-title: A tutorial on multiobjective optimization: Fundamentals and evolutionary methods publication-title: Natural Computing doi: 10.1007/s11047-018-9685-y – volume: 419 start-page: 359 issue: 2 year: 2006 ident: 10.1016/j.ejor.2022.01.002_bib0024 article-title: Absolute value equations publication-title: Linear Algebra and its Applications doi: 10.1016/j.laa.2006.05.004 – ident: 10.1016/j.ejor.2022.01.002_bib0027 – volume: 129 start-page: 285 issue: 2 year: 2011 ident: 10.1016/j.ejor.2022.01.002_bib0015 article-title: A note on the complexity of ℓp minimization publication-title: Mathematical Programming doi: 10.1007/s10107-011-0470-2 – volume: 24 start-page: 1485 issue: 3 year: 2014 ident: 10.1016/j.ejor.2022.01.002_bib0010 article-title: Distributionally robust stochastic knapsack problem publication-title: SIAM Journal on Optimization doi: 10.1137/130915315 – volume: 283 start-page: 549 issue: 2 year: 2020 ident: 10.1016/j.ejor.2022.01.002_bib0032 article-title: A distributionally robust optimization approach for outpatient colonoscopy scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.11.039 – ident: 10.1016/j.ejor.2022.01.002_bib0022 – start-page: 135 year: 2001 ident: 10.1016/j.ejor.2022.01.002_bib0030 article-title: On duality theory of conic linear problems – volume: 38 start-page: 325 issue: 4 year: 1987 ident: 10.1016/j.ejor.2022.01.002_bib0017 article-title: A shortest augmenting path algorithm for dense and sparse linear assignment problems publication-title: Computing doi: 10.1007/BF02278710 – volume: 101 start-page: 13 year: 2019 ident: 10.1016/j.ejor.2022.01.002_bib0026 article-title: Distributionally robust single machine scheduling with the total tardiness criterion publication-title: Computers & Operations Research doi: 10.1016/j.cor.2018.08.007 – year: 2020 ident: 10.1016/j.ejor.2022.01.002_bib0014 article-title: Optimization problems for machine learning: A survey publication-title: European Journal of Operational Research – volume: 9 start-page: 803 issue: 4 year: 1972 ident: 10.1016/j.ejor.2022.01.002_bib0004 article-title: More bounds on the expectation of a convex function of a random variable publication-title: Journal of Applied Probability doi: 10.2307/3212616 – start-page: 755 year: 2011 ident: 10.1016/j.ejor.2022.01.002_bib0034 article-title: Subspace embeddings for the l1-norm with applications |
| SSID | ssj0001515 |
| Score | 2.4693384 |
| Snippet | •Distributionally robust solution to total flow time minimization on parallel machines.•Reformulation of the problem in terms of norm... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 438 |
| SubjectTerms | Computational complexity Distributionally robust optimization Scheduling Total flow time Uncertain processing time |
| Title | Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations |
| URI | https://dx.doi.org/10.1016/j.ejor.2022.01.002 |
| Volume | 302 |
| WOSCitedRecordID | wos000829764400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLaqDSF44FJAbFzkB96ioDj3PE4wBAhNexiob5ET29DOTaY0Ldse-E_8Q45jOwmFTewBqYoit3Hani_25-NzvoPQKxaLjMcBcSOv5C4MeJ6bMiJcYMZJWPA0Y13phC-fkqOjdDbLjieTnzYXZiOTqkrPz7Oz_2pqaANjq9TZG5i77xQa4ByMDkcwOxz_yfBvlRSuqWJFpbxwmrpYr1oHlrEwrXTZ51R-rZt5-02LMQD9VBmRQqrqcvMld5TcyNLkZ6rNBCUPLiWXzrKLvOQrZ915GCrgu07TFbNvbDrnlZ5-w3qhobH-RyM0NDik6w09NYoGykvcxwZVtK2_mwLbKgLzki-GzaxSb1kdN3x5sZJjLwYsgFVQSDwa7IIkcX1f53HakTnw_BEE_dE4G2pJGDNlh1rp94_ZQDsmFq_5olbSr77fKbSaTn-T3t6aEvtARRsDt8hVH7nqI_dI3smX7vpJlMFAunvw4XD2sZ_-FUPstq7MDzKZWjqocPub_J0NjRjOyQN0zyxN8IGG1EM04dUU3baZEVN031YAwWZCmKK7IznLR-jHNvSwhh4eoIcH6GGAHu6ghxX0sIIeHkMPw8tCD1vo4Q56WEEPb0HvMfr87vDkzXvX1PdwyyAIWpcGMSt9BpSSp5REwitJxkpRhFlIBBUxvC9KxoHwwknkUeZRIE8EHnYGJzQJnqCdqq74U4QzmnoxJVwUPAzDqEgJYTwsYybCzCuY2EPE_s95acTvVQ0WmV9t4T3k9NecaemXaz8dWfPlhrxqUpoDGq-5bv9Gd3mG7gxPz3O00zZr_gLdKjftfNW8NFD8BWJrxlc |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributionally+robust+scheduling+algorithms+for+total+flow+time+minimization+on+parallel+machines+using+norm+regularizations&rft.jtitle=European+journal+of+operational+research&rft.au=Novak%2C+Antonin&rft.au=Gnatowski%2C+Andrzej&rft.au=Sucha%2C+Premysl&rft.date=2022-10-16&rft.issn=0377-2217&rft.volume=302&rft.issue=2&rft.spage=438&rft.epage=455&rft_id=info:doi/10.1016%2Fj.ejor.2022.01.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2022_01_002 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |