IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v52y2005i4p361-369.html
   My bibliography  Save this article

Single machine scheduling with a restricted rate‐modifying activity

Author

Listed:
  • Yong He
  • Min Ji
  • T. C. E. Cheng

Abstract

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005

Suggested Citation

  • Yong He & Min Ji & T. C. E. Cheng, 2005. "Single machine scheduling with a restricted rate‐modifying activity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 361-369, June.
    • Handle: RePEc:wly:navres:v:52:y:2005:i:4:p:361-369
    DOI: 10.1002/nav.20083
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20083
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20083?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
    ---><---

    References listed on IDEAS

    as
    1. Lee, C. -Y. & Leon, V. J., 2001. "Machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 128(1), pages 119-128, January.
    2. Lee, Chung-Yee, 1999. "Two-machine flowshop scheduling with availability constraints," European Journal of Operational Research, Elsevier, vol. 114(2), pages 420-429, April.
    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. 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.

    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. 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.
    2. Javad Seif & Mohammad Dehghanimohammadabadi & Andrew Junfang Yu, 2020. "Integrated preventive maintenance and flow shop scheduling under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 852-887, December.
    3. Lee, Chung-Yee & Lin, Chen-Sin, 2001. "Single-machine scheduling with maintenance and repair rate-modifying activities," European Journal of Operational Research, Elsevier, vol. 135(3), pages 493-513, December.
    4. 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.
    5. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    6. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    7. Tan, Zhiyi & Chen, Yong & Zhang, An, 2013. "On the exact bounds of SPT for scheduling on parallel machines with availability constraints," International Journal of Production Economics, Elsevier, vol. 146(1), pages 293-299.
    8. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    9. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    10. 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.
    11. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    12. Hsu, Hsi-Mei & Wang, Wen-Pai, 2004. "Dynamic programming for delayed product differentiation," European Journal of Operational Research, Elsevier, vol. 156(1), pages 183-193, July.
    13. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    14. Ali Salmasnia & Danial Mirabadi-Dastjerd, 2017. "Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 544-578, October.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Asaf Levin & Gur Mosheiov & Assaf Sarig, 2009. "Scheduling a maintenance activity on parallel identical machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(1), pages 33-41, February.
    20. Zhanguo Zhu & Feifeng Zheng & Chengbin Chu, 2017. "Multitasking scheduling problems with a rate-modifying activity," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 296-312, January.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:52:y:2005:i:4:p:361-369. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.