IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v29y2012i04ns0217595912500194.html
   My bibliography  Save this article

Single-Machine Scheduling With Proportionally Deteriorating Jobs Subject To Availability Constraints

Author

Listed:
  • SHISHENG LI

    (Department of Mathematics, Zhengzhou University, Zhengzhou 450001, PR China)

  • BAOQIANG FAN

    (Department of Mathematics and Information, Ludong University, Yantai 264025, PR China)

Abstract

We address the nonresumable version of the scheduling problem with proportionally deteriorating jobs on a single machine subject to availability constraints. The objective is to minimize the total weighted completion time. We show that there exists no polynomial-time algorithm with a constant worst-case ratio for the problem with two nonavailability intervals unless $\mathcal{P} = \mathcal{NP}$. Furthermore, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the problem with a single nonavailability interval.

Suggested Citation

  • Shisheng Li & Baoqiang Fan, 2012. "Single-Machine Scheduling With Proportionally Deteriorating Jobs Subject To Availability Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 29(04), pages 1-10.
    • Handle: RePEc:wsi:apjorx:v:29:y:2012:i:04:n:s0217595912500194
    DOI: 10.1142/S0217595912500194
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500194
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912500194?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. Na Yin & Liying Kang, 2015. "Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-12, 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:wsi:apjorx:v:29:y:2012:i:04:n:s0217595912500194. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.