IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v299y2022i2p420-431.html
   My bibliography  Save this article

Target-based distributionally robust optimization for single machine scheduling

Author

Listed:
  • Pei, Zhi
  • Lu, Haimin
  • Jin, Qingwei
  • Zhang, Lianmin

Abstract

In the traditional single-machine scheduling problem with uncertain processing time, distributionally robust optimization models are established in situations where the distribution information is not known exactly. One well-studied robust optimization method used in scheduling is the distributionally β-robust optimization technique. The goal of this technique is to maximize the probability that the total flow time of the job sequence does not exceed the predetermined target level T. However, it is possible that the excess value of the total flow time beyond the target T may be incredibly large, and therefore it is necessary to consider the optimized excess value. To address this concern, two new target-based risk measures are introduced. First, target-oriented CVaR, the worst-case conditional value-at-risk (CVaR) is used to minimize the excess value beyond T, which accounts for both the excess probability and the excess value. Second, the essential riskiness index (ERI) is extended to a multi-piecewise linear function for excess value control in single-machine scheduling problems. To obtain a tractable closed-form solutions of the risk measures, the CVaR-based measure is decomposed into an assignment problem and a second-order cone programming problem, and the ERI is converted to its equivalent semi-definite programming and second-order cone counterparts. To efficiently solve the risk measures for single-machine scheduling, a bisection search algorithm and a Benders decomposition algorithm are designed. In the numerical analysis, the excess value and the probability are investigated with respect to two distributions, namely the two-point distribution and the truncated normal distribution. The experiment design also considers different ranges of expectation and variance, tolerance levels, and problem scales. It is discovered that the CVaR and ERI-based methods are always better than the distributionally β-robust scheduling approach in terms of excess value.

Suggested Citation

  • Pei, Zhi & Lu, Haimin & Jin, Qingwei & Zhang, Lianmin, 2022. "Target-based distributionally robust optimization for single machine scheduling," European Journal of Operational Research, Elsevier, vol. 299(2), pages 420-431.
    • Handle: RePEc:eee:ejores:v:299:y:2022:i:2:p:420-431
    DOI: 10.1016/j.ejor.2021.08.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721007244
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.08.034?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    2. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    3. David B. Brown & Enrico De Giorgi & Melvyn Sim, 2012. "Aspirational Preferences and Their Representation by Risk Measures," Management Science, INFORMS, vol. 58(11), pages 2095-2113, November.
    4. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
    5. Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
    6. Chang, Zhiqi & Song, Shiji & Zhang, Yuli & Ding, Jian-Ya & Zhang, Rui & Chiong, Raymond, 2017. "Distributionally robust single machine scheduling with risk aversion," European Journal of Operational Research, Elsevier, vol. 256(1), pages 261-274.
    7. Soroush, H.M., 2007. "Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 181(1), pages 266-287, August.
    8. Fan Yue & Shiji Song & Yuli Zhang & Jatinder N.D. Gupta & Raymond Chiong, 2018. "Robust single machine scheduling with uncertain release times for minimising the maximum waiting time," International Journal of Production Research, Taylor & Francis Journals, vol. 56(16), pages 5576-5592, August.
    9. Feng, Wei & Feng, Yiping & Zhang, Qi, 2021. "Multistage robust mixed-integer optimization under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 294(2), pages 460-475.
    10. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    11. Marjan Akker & Han Hoogeveen & Judith Stoef, 2018. "Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times," Journal of Scheduling, Springer, vol. 21(6), pages 607-617, December.
    12. Davari, Morteza & Ranjbar, Mohammad & De Causmaecker, Patrick & Leus, Roel, 2020. "Minimizing makespan on a single machine with release dates and inventory constraints," European Journal of Operational Research, Elsevier, vol. 286(1), pages 115-128.
    13. Letsios, Dimitrios & Mistry, Miten & Misener, Ruth, 2021. "Exact lexicographic scheduling and approximate rescheduling," European Journal of Operational Research, Elsevier, vol. 290(2), pages 469-478.
    14. Wu, Xianyi & Zhou, Xian, 2008. "Stochastic scheduling to minimize expected maximum lateness," European Journal of Operational Research, Elsevier, vol. 190(1), pages 103-115, October.
    15. David B. Brown & Melvyn Sim, 2009. "Satisficing Measures for Analysis of Risky Positions," Management Science, INFORMS, vol. 55(1), pages 71-84, January.
    16. Lotfi, Somayyeh & Zenios, Stavros A., 2018. "Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances," European Journal of Operational Research, Elsevier, vol. 269(2), pages 556-576.
    17. Lucy Gongtao Chen & Daniel Zhuoyu Long & Georgia Perakis, 2015. "The Impact of a Target on Newsvendor Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 78-86, February.
    18. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    19. Shushang Zhu & Masao Fukushima, 2009. "Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management," Operations Research, INFORMS, vol. 57(5), pages 1155-1168, October.
    20. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    21. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    22. Herr, Oliver & Goel, Asvin, 2016. "Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints," European Journal of Operational Research, Elsevier, vol. 248(1), pages 123-135.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    2. Peiqi Yang & Zhi Pei, 2022. "Energy-Saving Manufacturing System Design with Two Geometric Machines," Sustainability, MDPI, vol. 14(18), pages 1-21, September.
    3. Haimin Lu & Zhi Pei, 2024. "A distributionally robust approach for the two-machine permutation flow shop scheduling," Annals of Operations Research, Springer, vol. 338(1), pages 709-739, July.
    4. Lu, Haimin & Pei, Zhi, 2023. "Single machine scheduling with release dates: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 308(1), pages 19-37.
    5. Abdul Rauf & Mahmoud Kassas & Muhammad Khalid, 2022. "Data-Driven Optimal Battery Storage Sizing for Grid-Connected Hybrid Distributed Generations Considering Solar and Wind Uncertainty," Sustainability, MDPI, vol. 14(17), pages 1-27, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lu, Haimin & Pei, Zhi, 2023. "Single machine scheduling with release dates: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 308(1), pages 19-37.
    2. Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
    3. Chang, Zhiqi & Song, Shiji & Zhang, Yuli & Ding, Jian-Ya & Zhang, Rui & Chiong, Raymond, 2017. "Distributionally robust single machine scheduling with risk aversion," European Journal of Operational Research, Elsevier, vol. 256(1), pages 261-274.
    4. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    5. Chen, Qingxin & Fu, Chenyi & Zhu, Ning & Ma, Shoufeng & He, Qiao-Chu, 2023. "A target-based optimization model for bike-sharing systems: From the perspective of service efficiency and equity," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 235-260.
    6. Guopeng Song & Roel Leus, 2022. "Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3059-3079, November.
    7. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    8. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    9. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    10. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
    11. Mina Roohnavazfar & Daniele Manerba & Lohic Fotio Tiotsop & Seyed Hamid Reza Pasandideh & Roberto Tadei, 2021. "Stochastic single machine scheduling problem as a multi-stage dynamic random decision process," Computational Management Science, Springer, vol. 18(3), pages 267-297, July.
    12. Luqi Qin & Erbao Cao, 2024. "Decision-making and performance of the agricultural supply chain: risk-neutral farmer vs target-oriented farmer," Annals of Operations Research, Springer, vol. 340(2), pages 961-980, September.
    13. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.
    14. Yuri N. Sotskov & Natalja G. Egorova, 2019. "The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective," Mathematics, MDPI, vol. 7(5), pages 1-21, April.
    15. Minglong Zhou & Melvyn Sim & Shao‐Wei Lam, 2022. "Advance admission scheduling via resource satisficing," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4002-4020, November.
    16. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    17. Haimin Lu & Zhi Pei, 2024. "A distributionally robust approach for the two-machine permutation flow shop scheduling," Annals of Operations Research, Springer, vol. 338(1), pages 709-739, July.
    18. Qiu, Ruozhen & Sun, Minghe & Lim, Yun Fong, 2017. "Optimizing (s, S) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches," European Journal of Operational Research, Elsevier, vol. 261(3), pages 880-892.
    19. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    20. Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz, 2018. "Multipolar robust optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 395-434, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:299:y:2022:i:2:p:420-431. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.