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

A Hybrid Two-Stage Flowshop Scheduling Problem

Author

Listed:
  • LONGMIN HE

    (Mathematics Department, Shanghai University, Shanghai 200444, P. R. China)

  • SHIJIE SUN

    (Mathematics Department, Shanghai University, Shanghai 200444, P. R. China)

  • RUNZI LUO

    (Mathematics Department, Nanchang University, Nanchang, Jiangxi, P. R. China)

Abstract

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists ofmdedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

Suggested Citation

  • Longmin He & Shijie Sun & Runzi Luo, 2007. "A Hybrid Two-Stage Flowshop Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(01), pages 45-56.
    • Handle: RePEc:wsi:apjorx:v:24:y:2007:i:01:n:s0217595907001036
    DOI: 10.1142/S0217595907001036
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595907001036
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595907001036?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:24:y:2007:i:01:n:s0217595907001036. 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.