IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i3d10.1007_s10951-023-00790-w.html
   My bibliography  Save this article

Scheduling with periodic availability constraints to minimize makespan

Author

Listed:
  • Lishi Yu

    (Zhejiang University)

  • Zhiyi Tan

    (Zhejiang University)

Abstract

We study scheduling problems with periodic availability constraints. Each machine is periodically unavailable due to routine arrangements or regular maintenance. The availability periods and unavailability periods, each with the same duration, appear alternately on each machine. All jobs are available at time zero, and no job preemption is allowed. The objective is to minimize the makespan. We conduct the worst-case analysis of two algorithms, SFFD and DFFD, with respect to parameter $$\beta $$ β , the ratio between the length of an unavailability period and an availability period. For the single machine problem, the worst-case ratio of the algorithm SFFD is given, and the bound is tight when $$\beta >0.1022$$ β > 0.1022 . An algorithm with a worst-case ratio arbitrarily close to $$\frac{2\beta +2}{\beta +2}$$ 2 β + 2 β + 2 is also presented. For the two machines problem, we propose a new algorithm DFFD and show its tight worst-case ratio.

Suggested Citation

  • Lishi Yu & Zhiyi Tan, 2024. "Scheduling with periodic availability constraints to minimize makespan," Journal of Scheduling, Springer, vol. 27(3), pages 277-297, June.
    • Handle: RePEc:spr:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00790-w
    DOI: 10.1007/s10951-023-00790-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-023-00790-w
    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/s10951-023-00790-w?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. X Qi & T Chen & F Tu, 1999. "Scheduling the maintenance on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1071-1078, October.
    2. Gawiejnowicz, Stanislaw & Kononov, Alexander, 2010. "Complexity and approximability of scheduling resumable proportionally deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 200(1), pages 305-308, January.
    3. Gawiejnowicz, Stanislaw, 2007. "Scheduling deteriorating jobs subject to job or machine availability constraints," European Journal of Operational Research, Elsevier, vol. 180(1), pages 472-478, July.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    5. 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.
    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. Zheng-Guo Lv & Li-Han Zhang & Xiao-Yuan Wang & Ji-Bo Wang, 2024. "Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization," Mathematics, MDPI, vol. 12(4), pages 1-15, February.
    2. 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.
    3. 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.
    4. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    5. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    6. Li, Shisheng & Ng, C.T. & Cheng, T.C.E. & Yuan, Jinjiang, 2011. "Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 210(3), pages 482-488, May.
    7. Briskorn, Dirk & Gönsch, Jochen & Thiemeyer, Antonia, 2024. "Scheduling maintenance activities subject to stochastic job-dependent machine deterioration," European Journal of Operational Research, Elsevier, vol. 319(1), pages 62-78.
    8. Xiao, Lei & Zhang, Xinghui & Tang, Junxuan & Zhou, Yaqin, 2020. "Joint optimization of opportunistic maintenance and production scheduling considering batch production mode and varying operational conditions," Reliability Engineering and System Safety, Elsevier, vol. 202(C).
    9. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    10. Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
    11. Frederik Ferid Ostermeier & Jochen Deuse, 2024. "Modelling forgetting due to intermittent production in mixed-model line scheduling," Flexible Services and Manufacturing Journal, Springer, vol. 36(2), pages 503-532, June.
    12. Xiang Wu & Kanjian Zhang & Ming Cheng, 2017. "Computational method for optimal machine scheduling problem with maintenance and production," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1791-1814, March.
    13. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
    14. K. H. Adjallah & K. P. Adzakpa, 2007. "Minimizing maintenance cost involving flow-time and tardiness penalty with unequal release dates," Journal of Risk and Reliability, , vol. 221(1), pages 57-65, March.
    15. 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.
    16. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    17. Stanisław Gawiejnowicz & Wiesław Kurc, 2020. "New results for an open time-dependent scheduling problem," Journal of Scheduling, Springer, vol. 23(6), pages 733-744, December.
    18. Gawiejnowicz, Stanislaw & Kononov, Alexander, 2010. "Complexity and approximability of scheduling resumable proportionally deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 200(1), pages 305-308, January.
    19. Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu, 2023. "Optimization of scheduling problems with deterioration effects and an optional maintenance activity," Journal of Scheduling, Springer, vol. 26(3), pages 251-266, June.
    20. Stanisław Gawiejnowicz & Bertrand Miao-Tsong Lin & Gur Mosheiov, 2024. "Dynamic scheduling problems in theory and practice," Journal of Scheduling, Springer, vol. 27(3), pages 225-226, June.

    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:jsched:v:27:y:2024:i:3:d:10.1007_s10951-023-00790-w. 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.