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

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times

Author

Listed:
  • Nesello, Vitor
  • Subramanian, Anand
  • Battarra, Maria
  • Laporte, Gilbert

Abstract

The single-machine scheduling problem with periodic maintenances and sequence-dependent setup times aims at scheduling jobs on a single machine in which periodic maintenances and setups are required. The objective is the minimization of the makespan. We propose an exact algorithm based on the iterative solution of three alternative arc-time-indexed models. Extensive computational experiments are carried out on 420 benchmark instances with up to 50 jobs, and on 405 newly proposed instances involving up to 150 jobs. We compare the results found by all formulations with those obtained by the best available mathematical formulation. All instances from the existing dataset are solved to optimality for the first time.

Suggested Citation

  • Nesello, Vitor & Subramanian, Anand & Battarra, Maria & Laporte, Gilbert, 2018. "Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 266(2), pages 498-507.
    • Handle: RePEc:eee:ejores:v:266:y:2018:i:2:p:498-507
    DOI: 10.1016/j.ejor.2017.10.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717309335
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.10.020?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. J S Chen, 2006. "Single-machine scheduling with flexible and periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 703-710, June.
    2. Ching-Jong Liao & Cheng-Hsiung Lee & Hsing-Tzu Tsai, 2016. "Scheduling with multi-attribute set-up times on unrelated parallel machines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4839-4853, August.
    3. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Chen, Jen-Shiang, 2008. "Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 190(1), pages 90-102, October.
    6. W J Chen, 2006. "Minimizing total flow time in the single-machine scheduling problem with periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 410-415, April.
    7. Xu, Dehua & Yin, Yunqiang & Li, Hongxing, 2009. "A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan"," European Journal of Operational Research, Elsevier, vol. 197(2), pages 825-827, September.
    8. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    9. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    10. 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.
    11. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    12. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    13. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
    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. Xiuli Wu & Junjian Peng & Xiao Xiao & Shaomin Wu, 2021. "An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading," Journal of Intelligent Manufacturing, Springer, vol. 32(3), pages 707-728, March.
    2. Zhang, Wenyu & Gan, Jie & He, Shuguang & Li, Ting & He, Zhen, 2024. "An integrated framework of preventive maintenance and task scheduling for repairable multi-unit systems," Reliability Engineering and System Safety, Elsevier, vol. 247(C).
    3. uit het Broek, Michiel A.J. & Van der Heide, Gerlach & Van Foreest, Nicky D., 2020. "Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs," European Journal of Operational Research, Elsevier, vol. 287(3), pages 916-928.
    4. Delorme, Maxence & Iori, Manuel & Mendes, Nilson F.M., 2021. "Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events," European Journal of Operational Research, Elsevier, vol. 295(3), pages 823-837.

    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. Xia, Tangbin & Jin, Xiaoning & Xi, Lifeng & Ni, Jun, 2015. "Production-driven opportunistic maintenance for batch production based on MAM–APB scheduling," European Journal of Operational Research, Elsevier, vol. 240(3), pages 781-790.
    2. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    3. Rachid Benmansour & Oliver Braun & Saïd Hanafi, 2019. "The single-processor scheduling problem with time restrictions: complexity and related problems," Journal of Scheduling, Springer, vol. 22(4), pages 465-471, August.
    4. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    5. Stéphane Dauzère-Pérès & Sigrid Lise Nonås, 2023. "An improved decision support model for scheduling production in an engineer-to-order manufacturer," 4OR, Springer, vol. 21(2), pages 247-300, June.
    6. Mosheiov, Gur & Sarig, Assaf & Strusevich, Vitaly A & Mosheiff, Jonathan, 2018. "Two-machine flow shop and open shop scheduling problems with a single maintenance window," European Journal of Operational Research, Elsevier, vol. 271(2), pages 388-400.
    7. Pereira, Jordi & Vásquez, Óscar C., 2017. "The single machine weighted mean squared deviation problem," European Journal of Operational Research, Elsevier, vol. 261(2), pages 515-529.
    8. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    9. Timo Gschwind & Stefan Irnich & Simon Emde & Christian Tilk, 2018. "Branch-Cut-and-Price for the Scheduling Deliveries with Time Windows in a Direct Shipping Network," Working Papers 1805, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. 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.
    11. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    12. Maria Fleischer Fauske & Carlo Mannino & Paolo Ventura, 2020. "Generalized Periodic Vehicle Routing and Maritime Surveillance," Transportation Science, INFORMS, vol. 54(1), pages 164-183, January.
    13. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    14. von Hoyningen-Huene, Wiebke & Kiesmüller, Gudrun P., 2015. "Maintenance and Production Scheduling on a Single Machine with Stochastic Failures," EconStor Preprints 106608, ZBW - Leibniz Information Centre for Economics.
    15. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    16. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
    17. Hoyningen-Huene, Wiebke von, 2015. "Heuristics for an Integrated Maintenance and Production Scheduling Problem on Parallel Machines with Stochastic Failures and Non-Resumable Jobs," EconStor Preprints 112746, ZBW - Leibniz Information Centre for Economics.
    18. von Hoyningen-Huene, W. & Kiesmüller, G.P., 2015. "Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures," European Journal of Operational Research, Elsevier, vol. 240(2), pages 439-446.
    19. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    20. Philippe Baptiste & Ruslan Sadykov, 2009. "On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 487-502, September.

    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:266:y:2018:i:2:p:498-507. 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.