Advanced Search
MyIDEAS: Login to save this article or follow this journal

Two-Stage Flowshop Scheduling Problems With Identical And Batch Processors

Contents:

Author Info

  • 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)

Registered author(s):

    Abstract

    This paper considers minimizing total completion time in a two-stage flowshop scheduling problem with m identical 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 is NP – hard and gave a two-approximation algorithm in O(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 strongly NP – hard. Hundreds of instances of a numerical experiment show that the worst-case ratio of this approximation algorithm is nearing 2.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595910002909
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595910002909
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal Asia-Pacific Journal of Operational Research.

    Volume (Year): 27 (2010)
    Issue (Month): 05 ()
    Pages: 617-627

    as in new window
    Handle: RePEc:wsi:apjorx:v:27:y:2010:i:05:p:617-627

    Contact details of provider:
    Web page: http://www.worldscinet.com/apjor/apjor.shtml

    Order Information:
    Email:

    Related research

    Keywords: Scheduling; flowshop; identical machine; batch processor; complexity; algorithm;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:27:y:2010:i:05:p:617-627. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.