IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v68y2017icp119-122.html
   My bibliography  Save this article

On single-machine scheduling with workload-dependent maintenance duration

Author

Listed:
  • Luo, Wenchang
  • Liu, Feng

Abstract

In this paper, we consider a single-machine scheduling problem with workload-dependent maintenance duration. The objective is to minimize the total weighted completion time. For the case where the maintenance duration is an arbitrarily non-decreasing function on the workload, we propose a (2+ε)-approximation algorithm and a fully polynomial time approximation scheme, which extends the previous results presented by Xu et al. [Single machine total completion time scheduling problem with workload-dependent maintenance duration. Omega 2015;52:101–6].

Suggested Citation

  • Luo, Wenchang & Liu, Feng, 2017. "On single-machine scheduling with workload-dependent maintenance duration," Omega, Elsevier, vol. 68(C), pages 119-122.
    • Handle: RePEc:eee:jomega:v:68:y:2017:i:c:p:119-122
    DOI: 10.1016/j.omega.2016.06.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048316303358
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2016.06.008?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. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    2. M. A. Kubzin & V. A. Strusevich, 2006. "Planning Machine Maintenance in Two-Machine Shop Scheduling," Operations Research, INFORMS, vol. 54(4), pages 789-800, August.
    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. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    2. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    3. Wang, Dujuan & Yin, Yunqiang & Cheng, T.C.E., 2018. "Parallel-machine rescheduling with job unavailability and rejection," Omega, Elsevier, vol. 81(C), pages 246-260.
    4. Jiang, Junwei & An, Youjun & Dong, Yuanfa & Hu, Jiawen & Li, Yinghe & Zhao, Ziye, 2023. "Integrated optimization of non-permutation flow shop scheduling and maintenance planning with variable processing speed," Reliability Engineering and System Safety, Elsevier, vol. 234(C).

    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. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. Finke, Gerd & Gara-Ali, Ahmed & Espinouse, Marie-Laure & Jost, Vincent & Moncel, Julien, 2017. "Unified matrix approach to solve production-maintenance problems on a single machine," Omega, Elsevier, vol. 66(PA), pages 140-146.
    3. Wenchang Luo & Lin Chen & Guochuan Zhang, 2012. "Approximation schemes for two-machine flow shop scheduling with two agents," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 229-239, October.
    4. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    5. 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.
    6. Li, Guo & Liu, Mengqi & Sethi, Suresh P. & Xu, Dehua, 2017. "Parallel-machine scheduling with machine-dependent maintenance periodic recycles," International Journal of Production Economics, Elsevier, vol. 186(C), pages 1-7.
    7. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    8. Mor, Baruch & Mosheiov, Gur, 2012. "Scheduling a maintenance activity and due-window assignment based on common flow allowance," International Journal of Production Economics, Elsevier, vol. 135(1), pages 222-230.
    9. 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.
    10. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    11. Bazargan, Massoud, 2015. "An optimization approach to aircraft dispatching strategy with maintenance cost – A case study," Journal of Air Transport Management, Elsevier, vol. 42(C), pages 10-14.
    12. G Mosheiov & J B Sidney, 2010. "Scheduling a deteriorating maintenance activity on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 882-887, May.
    13. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    14. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    15. Jaehn, Florian, 2024. "Scheduling with jobs at fixed positions," European Journal of Operational Research, Elsevier, vol. 318(2), pages 388-397.
    16. Cheng, T.C.E. & Yang, Suh-Jenq & Yang, Dar-Li, 2012. "Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity," International Journal of Production Economics, Elsevier, vol. 135(1), pages 154-161.
    17. Imed Kacem & Hans Kellerer & Maryam Seifaddini, 2016. "Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 970-981, October.
    18. Chun-Lai Liu & Jian-Jun Wang, 2016. "Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-16, February.
    19. Shi-Sheng Li & Ren-Xia Chen, 2017. "Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(02), pages 1-17, April.
    20. Gara-Ali, Ahmed & Finke, Gerd & Espinouse, Marie-Laure, 2016. "Parallel-machine scheduling with maintenance: Praising the assignment problem," European Journal of Operational Research, Elsevier, vol. 252(1), pages 90-97.

    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:jomega:v:68:y:2017:i:c:p:119-122. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.