IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v23y2023i3d10.1007_s12351-023-00789-3.html
   My bibliography  Save this article

Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times

Author

Listed:
  • Tugba Saraç

    (Eskisehir Osmangazi University)

  • Feristah Ozcelik

    (Eskisehir Osmangazi University)

  • Mehmet Ertem

    (Eskisehir Osmangazi University)

Abstract

Unrelated parallel machine scheduling problem (UPM) is widely studied in the scheduling literature because of its extensive application area in the industry. Since it has a stochastic nature, several studies handled the problem as stochastic. However, most of the studies that have considered the problem as stochastic focused only on the case of stochastic processing times. Whereas, especially in industries where setup times are sequence and machine-dependent, these are often stochastic, as well. Although this situation has been ignored in the literature for a long time, it has been examined only in a few studies. In this study, for the first time, an exact solution method is proposed to solve UPM with stochastic sequence-dependent setup times (SDSTs). For the considered problem, a two-stage stochastic programming method is proposed. A mathematical model and a genetic algorithm are developed for the stochastic problem. The effectiveness of the proposed solution approaches is demonstrated using randomly generated test problems. The test results demonstrate the importance of considering the SDSTs as stochastic.

Suggested Citation

  • Tugba Saraç & Feristah Ozcelik & Mehmet Ertem, 2023. "Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times," Operational Research, Springer, vol. 23(3), pages 1-19, September.
    • Handle: RePEc:spr:operea:v:23:y:2023:i:3:d:10.1007_s12351-023-00789-3
    DOI: 10.1007/s12351-023-00789-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-023-00789-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-023-00789-3?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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Rajendran, Chandrasekharan & Ziegler, Hans, 2003. "Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 149(3), pages 513-522, September.
    3. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    4. Jinwei Gu & Manzhan Gu & Xingsheng Gu, 2014. "Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-9, September.
    5. Ali Salmasnia & Mostafa Khatami & Reza Kazemzadeh & Seyed Zegordi, 2015. "Bi-objective single machine scheduling problem with stochastic processing times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 275-297, April.
    6. Varun Gupta & Benjamin Moseley & Marc Uetz & Qiaomin Xie, 2020. "Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 497-516, May.
    7. 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.
    8. Xin Liu & Feng Chu & Feifeng Zheng & Chengbin Chu & Ming Liu, 2021. "Parallel machine scheduling with stochastic release times and processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 59(20), pages 6327-6346, October.
    9. Semih Atakan & Kerem Bülbül & Nilay Noyan, 2017. "Minimizing value-at-risk in single-machine scheduling," Annals of Operations Research, Springer, vol. 248(1), pages 25-73, January.
    10. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    11. Novak, Antonin & Sucha, Premysl & Novotny, Matej & Stec, Richard & Hanzalek, Zdenek, 2022. "Scheduling jobs with normally distributed processing times on parallel machines," European Journal of Operational Research, Elsevier, vol. 297(2), pages 422-441.
    12. Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
    13. Anupam Gupta & Amit Kumar & Viswanath Nagarajan & Xiangkun Shen, 2021. "Stochastic Load Balancing on Unrelated Machines," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 115-133, February.
    14. Lei Xu & Qian Wang & Simin Huang, 2015. "Dynamic order acceptance and scheduling problem with sequence-dependent setup time," International Journal of Production Research, Taylor & Francis Journals, vol. 53(19), pages 5797-5808, October.
    15. Mehmet Ertem & Feristah Ozcelik & Tugba Saraç, 2019. "Single machine scheduling problem with stochastic sequence-dependent setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3273-3289, May.
    Full references (including those not matched with items on IDEAS)

    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. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    3. V. Anjana & R. Sridharan & P. N. Ram Kumar, 2020. "Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times," Journal of Scheduling, Springer, vol. 23(1), pages 49-69, February.
    4. 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.
    5. Nilay Noyan & Gábor Rudolf & Miguel Lejeune, 2022. "Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 729-751, March.
    6. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    7. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
    8. Yue, Qing & Zhou, Shenghai, 2021. "Due-window assignment scheduling problem with stochastic processing times," European Journal of Operational Research, Elsevier, vol. 290(2), pages 453-468.
    9. Ana Rita Antunes & Marina A. Matos & Ana Maria A. C. Rocha & Lino A. Costa & Leonilde R. Varela, 2022. "A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    10. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    11. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    12. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    13. Hongjun Wei & Jinjiang Yuan & Yuan Gao, 2019. "Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time," Mathematics, MDPI, vol. 7(9), pages 1-10, September.
    14. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    15. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    16. Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
    17. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    18. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    19. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    20. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2021. "Risk of delay evaluation in real-time train scheduling with uncertain dwell times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).

    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:spr:operea:v:23:y:2023:i:3:d:10.1007_s12351-023-00789-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.