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

Two-Machine Flow Shop Scheduling With Individual Operation'S Rejection

Author

Listed:
  • QIANG GAO

    (Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China)

  • XIWEN LU

    (Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China)

Abstract

A two-machine flow shop scheduling problem with rejection is considered in this paper. The objective is to minimize the sum of makespan of accepted operations and total penalty of rejected operations. Each job has two operations that could be rejected, respectively. Operations on the first machine have penalties α1 times of their processing times and operations on the second machine have penalties α2 times of their processing times. A $\frac{4}{3}$-approximation algorithm is presented for the case where min{α1, α2}

Suggested Citation

  • Qiang Gao & Xiwen Lu, 2014. "Two-Machine Flow Shop Scheduling With Individual Operation'S Rejection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(01), pages 1-13.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:01:n:s021759591450002x
    DOI: 10.1142/S021759591450002X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591450002X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591450002X?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. Shabtay, Dvir & Gerstl, Enrique, 2024. "Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 887-898.

    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:31:y:2014:i:01:n:s021759591450002x. 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.