IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i3d10.1023_a1011449311477.html
   My bibliography  Save this article

Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms

Author

Listed:
  • Shyh-In Hwang

    (Yuan Ze University)

  • Sheng-Tzong Cheng

    (National Cheng Kung University)

Abstract

Real-time computer systems are essential for many applications, such as robot control, avionics, medical instrumentation, manufacturing, etc. The correctness of the system depends on the temporal correctness as well as the functional correctness of the task executions. In order to assure temporal correctness it is necessary that the resources be scheduled to meet the temporal requirements of applications. When we consider the problem of nonpreemptive scheduling of a set of tasks in a processor for which no feasible solution exists, some tasks may have to be rejected so that a schedule can be generated for the rest. In this paper, we consider the problem of generating an optimal schedule such that the number of rejected tasks is minimized, and then the finish time is minimized for the accepted tasks. We propose to use an analytic approach to solve this problem. We first discuss the super sequence based technique which was originally proposed for reducing the search space in testing the feasibility of a task set. Then we show by the Conformation theorem that the super sequence constructed from the task set also provides a valid and reduced search space for the optimization problem. While the complexity of our scheduling algorithm in the worst case remains exponential, our simulation results show that the cost is reasonable for the average case.

Suggested Citation

  • Shyh-In Hwang & Sheng-Tzong Cheng, 2001. "Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 345-375, September.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011449311477
    DOI: 10.1023/A:1011449311477
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011449311477
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011449311477?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. J. Erschler & G. Fontan & C. Merce & F. Roubellat, 1983. "A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates," Operations Research, INFORMS, vol. 31(1), pages 114-127, 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. Sergey Bereg & Andrew Brunner & Luis-Evaristo Caraballo & José-Miguel Díaz-Báñez & Mario A. Lopez, 2020. "On the robustness of a synchronized multi-robot system," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 988-1016, May.

    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. 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.
    2. Akturk, M. Selim & Ozdemir, Deniz, 2001. "A new dominance rule to minimize total weighted tardiness with unequal release dates," European Journal of Operational Research, Elsevier, vol. 135(2), pages 394-412, December.

    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:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011449311477. 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.