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

Two-Stage Flowshop Scheduling Problems With Identical And Batch Processors

Author

Listed:
  • WEN-WEI WANG

    (Department of Mathematics, Shanghai University, Shanghai 200444, China)

  • LONG-MIN HE

    (Department of Mathematics, Shanghai University, Shanghai 200444, China)

  • MING-BAO CHENG

    (Management School, Guangdong University of Technology, Guangdong 510520, China)

Abstract

This paper considers minimizing total completion time in a two-stage flowshop scheduling problem withmidentical parallel machines at Stage 1 and a batch processor at Stage 2. We prove that the problem when all jobs have same processing time at Stage 2 isNP – hardand gave a two-approximation algorithm inO(n3)time. In the case that all jobs have arbitrary processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is stronglyNP – hard. Hundreds of instances of a numerical experiment show that the worst-case ratio of this approximation algorithm is nearing 2.

Suggested Citation

  • Wen-Wei Wang & Long-Min He & Ming-Bao Cheng, 2010. "Two-Stage Flowshop Scheduling Problems With Identical And Batch Processors," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(05), pages 617-627.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:05:n:s0217595910002909
    DOI: 10.1142/S0217595910002909
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002909
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595910002909?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.

    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:27:y:2010:i:05:n:s0217595910002909. 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.