IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v35y1988i1p35-47.html
   My bibliography  Save this article

Minimizing the sum of weighted completion times of n‐independent jobs when resource availability varies over time: Performance of a simple priority rule

Author

Listed:
  • Julius Surkis
  • Ali Dogramaci

Abstract

In this article our objective is to evaluate the performance of a WSPT (weighted shortest processing time) rule for scheduling n independent jobs where the resources to process these jobs vary over time and a job can be processed by several processors simultaneously. This problem was raised by Baker and Nuttle [2]. A linear‐programming (LP) model is formulated to obtain a lower bound on the minimum value of the weighted completion times. The purpose of the model is to provide a basis for evaluating the WSPT heuristic. 1000 experiments were performed using different resource profiles to test the performance of WSPT. Using WSPT, the weighted completion times were found to be, on the average, 0.2% away from their LP lower bounds.

Suggested Citation

  • Julius Surkis & Ali Dogramaci, 1988. "Minimizing the sum of weighted completion times of n‐independent jobs when resource availability varies over time: Performance of a simple priority rule," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 35-47, February.
    • Handle: RePEc:wly:navres:v:35:y:1988:i:1:p:35-47
    DOI: 10.1002/1520-6750(198802)35:13.0.CO;2-3
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198802)35:13.0.CO;2-3
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198802)35:13.0.CO;2-3?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
    ---><---

    References listed on IDEAS

    as
    1. Kenneth R. Baker & Henry L. W. Nuttle, 1980. "Sequencing independent jobs with a single resource," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(3), pages 499-510, September.
    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. I. Adiri & O. Hamberg, 1998. "Openshop scheduling under linear resources constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(1), pages 51-66, February.

    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. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    2. V. Jorge Leon & S. David Wu, 1992. "On scheduling with ready‐times, due‐dates and vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(1), pages 53-65, February.
    3. I. Adiri & O. Hamberg, 1998. "Openshop scheduling under linear resources constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(1), pages 51-66, February.

    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:wly:navres:v:35:y:1988:i:1:p:35-47. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.