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

Match-up scheduling of mixed-criticality jobs: Maximizing the probability of jobs execution

Author

Listed:
  • Seddik, Yasmina
  • Hanzálek, Zdenek

Abstract

This paper deals with a mixed-criticality scheduling problem: each job has a criticality level depending on its importance. In addition, each job has a finite set of possible processing times, and a known probability for each of them. Every job must be processed between its release date and its deadline. Moreover, each job has a weight corresponding to its payoff. This problem has applications in single machine scheduling of real time embedded systems scheduling, production and operating theaters.

Suggested Citation

  • Seddik, Yasmina & Hanzálek, Zdenek, 2017. "Match-up scheduling of mixed-criticality jobs: Maximizing the probability of jobs execution," European Journal of Operational Research, Elsevier, vol. 262(1), pages 46-59.
    • Handle: RePEc:eee:ejores:v:262:y:2017:i:1:p:46-59
    DOI: 10.1016/j.ejor.2017.03.054
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171730276X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.03.054?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. Akturk, M. Selim & Gorgulu, Elif, 1999. "Match-up scheduling under a machine breakdown," European Journal of Operational Research, Elsevier, vol. 112(1), pages 81-97, January.
    2. James C. Bean & John R. Birge & John Mittenthal & Charles E. Noon, 1991. "Matchup Scheduling with Multiple Resources, Release Dates and Disruptions," Operations Research, INFORMS, vol. 39(3), pages 470-483, June.
    3. Lersteau, Charly & Rossi, André & Sevaux, Marc, 2016. "Robust scheduling of wireless sensor networks for target tracking under uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 407-417.
    4. Brian T. Denton & Andrew J. Miller & Hari J. Balasubramanian & Todd R. Huschka, 2010. "Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty," Operations Research, INFORMS, vol. 58(4-part-1), pages 802-816, August.
    5. Dubois, Didier & Fargier, Helene & Fortemps, Philippe, 2003. "Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge," European Journal of Operational Research, Elsevier, vol. 147(2), pages 231-252, June.
    6. Choi, Byung-Cheon & Chung, Kwanghun, 2016. "Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 367-375.
    7. Bhaskar, Tarun & Pal, Manabendra N. & Pal, Asim K., 2011. "A heuristic method for RCPSP with fuzzy activity times," European Journal of Operational Research, Elsevier, vol. 208(1), pages 57-66, January.
    8. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    9. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    10. Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
    11. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, 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. Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
    2. Antonin Novak & Zdenek Hanzalek, 2022. "Computing the execution probability of jobs with replication in mixed-criticality schedules," Annals of Operations Research, Springer, vol. 309(1), pages 209-232, February.

    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. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    2. Jorge M. S. Valente, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, Universidade do Porto, Faculdade de Economia do Porto.
    3. Black, Gary W. & McKay, Kenneth N. & Morton, Thomas E., 2006. "Aversion scheduling in the presence of risky jobs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 338-361, November.
    4. Silva, Thiago A.O. & de Souza, Mauricio C., 2020. "Surgical scheduling under uncertainty by approximate dynamic programming," Omega, Elsevier, vol. 95(C).
    5. N Nekoiemehr & G Moslehi, 2011. "Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1403-1412, July.
    6. Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.
    7. Jian Yang & Xiangtong Qi & Gang Yu, 2005. "Disruption management in production planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 420-442, August.
    8. Detienne, Boris & Pinson, Éric & Rivreau, David, 2010. "Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates," European Journal of Operational Research, Elsevier, vol. 201(1), pages 45-54, February.
    9. Balouka, Noemie & Cohen, Izack, 2021. "A robust optimization approach for the multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 291(2), pages 457-470.
    10. Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
    11. Valente, Jorge M.S. & Alves, Rui A.F.S., 2007. "Heuristics for the early/tardy scheduling problem with release dates," International Journal of Production Economics, Elsevier, vol. 106(1), pages 261-274, March.
    12. Yin, Yunqiang & Cheng, T.C.E. & Wang, Du-Juan, 2016. "Rescheduling on identical parallel machines with machine disruptions to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 252(3), pages 737-749.
    13. Liu, Zhixin & Lu, Liang & Qi, Xiangtong, 2018. "Cost allocation in rescheduling with machine unavailable period," European Journal of Operational Research, Elsevier, vol. 266(1), pages 16-28.
    14. 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.
    15. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    16. Schaller, Jeffrey E. & Gupta, Jatinder N.D., 2008. "Single machine scheduling with family setups to minimize total earliness and tardiness," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1050-1068, June.
    17. Ripon K. Chakrabortty & Ruhul A. Sarker & Daryl L. Essam, 2020. "Single mode resource constrained project scheduling with unreliable resources," Operational Research, Springer, vol. 20(3), pages 1369-1403, September.
    18. Jürgen Kuster & Dietmar Jannach & Gerhard Friedrich, 2010. "Applying Local Rescheduling in response to schedule disruptions," Annals of Operations Research, Springer, vol. 180(1), pages 265-282, November.
    19. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    20. M Ozlen & M Azizoğlu, 2011. "Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 152-164, January.

    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:262:y:2017:i:1:p:46-59. 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.