IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v31y1983i1p114-127.html
   My bibliography  Save this article

A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates

Author

Listed:
  • J. Erschler

    (Institut National des Sciences Appliquées, Toulouse, France)

  • G. Fontan

    (Université Paul Sabatier, Toulouse, France)

  • C. Merce

    (Institut National des Sciences Appliquées, Toulouse, France)

  • F. Roubellat

    (Centre National de la Recherche Scientifique, Toulouse, France)

Abstract

Scheduling a set of jobs on a single machine is studied where each job has a specified ready time and due date (limit times). A dominance relationship is established within the set of possible sequences and results in an important restriction of the number of sequences to be considered in solving the feasibility problem. Establishing the dominance relationship leading to this restriction requires only the ordering of ready times and due dates and is thus independent of job processing times and of any change in limit times which does not affect the given order.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:1:p:114-127
    DOI: 10.1287/opre.31.1.114
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.1.114
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.1.114?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
    ---><---

    Citations

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


    Cited by:

    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. 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.
    3. 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:inm:oropre:v:31:y:1983:i:1:p:114-127. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.