IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3203728.html
   My bibliography  Save this article

Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

Author

Listed:
  • Shuguang Li

Abstract

The problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set. Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap. All jobs are available for processing at time 0. The goal is to minimize the time by which all jobs are delivered, which is equivalent to minimizing the maximum lateness from the optimization viewpoint. A list scheduling approach is analyzed and its approximation ratio of 2 is established. In addition, a polynomial time approximation scheme is derived.

Suggested Citation

  • Shuguang Li, 2016. "Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-5, September.
    • Handle: RePEc:hin:jnlmpe:3203728
    DOI: 10.1155/2016/3203728
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/3203728.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2016/3203728.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/3203728?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
    ---><---

    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:hin:jnlmpe:3203728. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.