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

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

Author

Listed:
  • I. Adiri
  • E. Frostig
  • A. H. G. Rinnooy Kan

Abstract

Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

Suggested Citation

  • I. Adiri & E. Frostig & A. H. G. Rinnooy Kan, 1991. "Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(2), pages 261-271, April.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:2:p:261-271
    DOI: 10.1002/1520-6750(199104)38:23.0.CO;2-I
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199104)38:23.0.CO;2-I
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199104)38:23.0.CO;2-I?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. Michael Pinedo, 1983. "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, INFORMS, vol. 31(3), pages 559-572, June.
    2. Hiroshi Kise & Toshihide Ibaraki & Hisashi Mine, 1978. "A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times," Operations Research, INFORMS, vol. 26(1), pages 121-126, February.
    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. 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.
    2. Yarlin Kuo & Zi‐Ann Chang, 2007. "Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 602-614, September.
    3. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2009. "Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information," Operations Research, INFORMS, vol. 57(5), pages 1236-1249, October.
    4. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2021. "Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns," Annals of Operations Research, Springer, vol. 298(1), pages 43-64, March.
    5. Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
    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.

    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. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    2. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    3. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    4. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    5. Setareh Boshrouei Shargh & Mostafa Zandieh & Ashkan Ayough & Farbod Farhadi, 2024. "Scheduling in services: a review and bibliometric analysis," Operations Management Research, Springer, vol. 17(2), pages 754-783, June.
    6. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.
    7. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 2002. "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, Elsevier, vol. 76(2), pages 147-157, March.
    8. Marbán Sebastián & Rutten Cyriel & Vredeveld Tjark, 2010. "Asymptotic optimality of SEPT in Bayesian Scheduling," Research Memorandum 051, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Zhankun Sun & Nilay Tanık Argon & Serhan Ziya, 2022. "When to Triage in Service Systems with Hidden Customer Class Identities?," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 172-193, January.
    10. Federico Malucelli & Sara Nicoloso, 2007. "Shiftable intervals," Annals of Operations Research, Springer, vol. 150(1), pages 137-157, March.
    11. M'Hallah, Rym & Bulfin, R.L., 2007. "Minimizing the weighted number of tardy jobs on a single machine with release dates," European Journal of Operational Research, Elsevier, vol. 176(2), pages 727-744, January.
    12. Zhankun Sun & Nilay Tan?k Argon & Serhan Ziya, 2018. "Patient Triage and Prioritization Under Austere Conditions," Management Science, INFORMS, vol. 64(10), pages 4471-4489, October.
    13. Koulamas, Christos & Kyparisis, George J., 2001. "Single machine scheduling with release times, deadlines and tardiness objectives," European Journal of Operational Research, Elsevier, vol. 133(2), pages 447-453, January.
    14. Sheldon M. Ross, 2015. "A sequential scheduling problem with impatient jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(8), pages 659-663, December.
    15. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    16. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    17. Huiyin Ouyang & Nilay Taník Argon & Serhan Ziya, 2022. "Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs," Management Science, INFORMS, vol. 68(2), pages 1233-1255, February.
    18. Maciej Drwal & Jerzy Józefczyk, 2020. "Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times," Annals of Operations Research, Springer, vol. 284(1), pages 263-282, January.
    19. Xu Yong & Liu Jian & Ma Baomei & Zhang Shuai, 2018. "Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System," Journal of Systems Science and Information, De Gruyter, vol. 6(6), pages 481-494, December.
    20. Mosheiov, Gur & Sarig, Assaf, 2010. "Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine," European Journal of Operational Research, Elsevier, vol. 201(2), pages 404-408, March.

    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:38:y:1991:i:2:p:261-271. 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.