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

Scheduling Proportionally Deteriorating Jobs In Two-Machine Open Shop With A Non-Bottleneck Machine

Author

Listed:
  • SHISHENG LI

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

Abstract

We address the problem of scheduling proportionally deteriorating jobs in two-machine open shop in which one of the machines is non-bottleneck. The objective is to minimize the makespan. We show that the decision version of the problem is$\mathcal{NP}$-complete in the ordinary sense, and present for it a fully polynomial-time approximation scheme.

Suggested Citation

  • Shisheng Li, 2011. "Scheduling Proportionally Deteriorating Jobs In Two-Machine Open Shop With A Non-Bottleneck Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(05), pages 623-631.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:05:n:s0217595911003478
    DOI: 10.1142/S0217595911003478
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003478
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003478?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. Chuanli Zhao & Hengyong Tang, 2016. "Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-10, December.
    2. Xiang Chu & Qiu-Yan Zhong & Shahid G. Khokhar, 2015. "Triage Scheduling Optimization for Mass Casualty and Disaster Response," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-20, December.
    3. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.

    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:28:y:2011:i:05:n:s0217595911003478. 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.