IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i1-supplement-1ps76-s85.html
   My bibliography  Save this article

Fixed Job Scheduling with Two Types of Processors

Author

Listed:
  • V. R. Dondeti

    (Norfolk State University, Norfolk, Virginia)

  • Hamilton Emmons

    (Case Western Reserve University, Cleveland, Ohio)

Abstract

We consider a scheduling problem that involves two types of processors, but three types of jobs. Each job has a fixed start time and a fixed completion time, and falls into one of three types. Jobs of type 1 can be done only by type-1 processors, type-2 jobs only by type-2 processors, and type-0 jobs by either type of processors. We present a polynomial algorithm for finding the minimal cost combination of the two types of processors required to complete all jobs. The steps of the algorithm consist of constructing a job schedule network, transforming it into a single-commodity flow problem and finding the maximal flow through it.

Suggested Citation

  • V. R. Dondeti & Hamilton Emmons, 1992. "Fixed Job Scheduling with Two Types of Processors," Operations Research, INFORMS, vol. 40(1-supplem), pages 76-85, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1-supplement-1:p:s76-s85
    DOI: 10.1287/opre.40.1.S76
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.1.S76
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.1.S76?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. Gabrel, Virginie, 1995. "Scheduling jobs within time windows on identical parallel machines: New model and algorithms," European Journal of Operational Research, Elsevier, vol. 83(2), pages 320-329, June.
    2. Diego B.C. Faneyte & Frits C.R. Spieksma & Gerhard J. Woeginger, 2002. "A branch‐and‐price algorithm for a hierarchical crew scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(8), pages 743-759, December.
    3. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    4. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.
    5. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    6. Kroon, Leo G. & Edwin Romeijn, H. & Zwaneveld, Peter J., 1997. "Routing trains through railway stations: complexity issues," European Journal of Operational Research, Elsevier, vol. 98(3), pages 485-498, May.

    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:40:y:1992:i:1-supplement-1:p:s76-s85. 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.