IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v107y2001i1p303-31910.1023-a1014971620268.html
   My bibliography  Save this article

Preemptive Scheduling with Two Minimax Criteria

Author

Listed:
  • Francis Sourd

Abstract

Two preemptive single-machine bicriteria scheduling problems with release dates and deadlines are considered in this paper. Each criterion is formulated as a maximum cost. In the first problem the cost of both criteria depends on the completion time of the tasks. This problem can be solved by enumerating all the Pareto optimal points with an approach proposed by Hoogeveen (1996) for the nonpreemptive problem without release dates. In the second problem, the costs of one criterion are dependent on the completion times of the tasks and the costs of the other criterion are dependent on the start times. This problem is more difficult but an efficient algorithm is proposed for a sub-problem with heads, tails, release dates and deadlines that appears in the job-shop scheduling problem. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Francis Sourd, 2001. "Preemptive Scheduling with Two Minimax Criteria," Annals of Operations Research, Springer, vol. 107(1), pages 303-319, October.
    • Handle: RePEc:spr:annopr:v:107:y:2001:i:1:p:303-319:10.1023/a:1014971620268
    DOI: 10.1023/A:1014971620268
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014971620268
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014971620268?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    3. Andreas C. Nearchou, 2018. "Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm," Journal of Heuristics, Springer, vol. 24(6), pages 817-851, December.
    4. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.

    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:annopr:v:107:y:2001:i:1:p:303-319:10.1023/a:1014971620268. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.