IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p41-5810.1023-a1018968332237.html
   My bibliography  Save this article

Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problem

Author

Listed:
  • J. Carlier
  • E. Pinson

Abstract

The aim of this paper is to introduce Jackson's Pseudo Preemptive Schedule (JPPS) for the m parallel and identical processor scheduling problem Pm/r i , q i /C max . JPPS generalizes Jackson's Preemptive Schedule (JPS) which was introduced for the one-processor sequencing problem 1/r i , q i /C max . JPS can be computed in O(nlog n) time and plays a central role in solving NP-hard disjunctive scheduling problems such as the job shop problem. The make-span of JPPS can be computed in O(nlog n + nmlog m) time, and is a tight lower bound for the Pm/r i , q i /C max . So JPPS could also play a central role in solving the Resource Constrained Project Scheduling Problem. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • J. Carlier & E. Pinson, 1998. "Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problem," Annals of Operations Research, Springer, vol. 83(0), pages 41-58, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:41-58:10.1023/a:1018968332237
    DOI: 10.1023/A:1018968332237
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018968332237
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018968332237?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. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    2. Arkhipov, Dmitry & Battaïa, Olga & Lazarev, Alexander, 2019. "An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 35-44.
    3. Ann Vandevelde & Han Hoogeveen & Cor Hurkens & Jan Karel Lenstra, 2005. "Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 305-320, August.

    More about this item

    Statistics

    Access and download statistics

    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:83:y:1998:i:0:p:41-58:10.1023/a:1018968332237. 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.