IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v45y2014i3p571-578.html
   My bibliography  Save this article

Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

Author

Listed:
  • Bayi Cheng
  • Shanlin Yang
  • Xiaoxuan Hu
  • Kai Li

Abstract

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot exceed the machine capacity. Once a batch is being processed, no interruption is allowed until all the jobs in it are completed. The problem of minimising makespan is NP-hard in the strong sense. First, we present a mathematical model of the problem using integer programme. We show the scale of feasible solutions of the problem and provide optimality properties. Then, we propose a polynomial time algorithm with running time in O(nlogn). The jobs are first assigned in feasible batches and then scheduled on machines. For the general case, we prove that the proposed algorithm has a performance guarantee of 4. For the special case where the processing times of each job on the two machines satisfy p1j = ap2j, the performance guarantee is for a > 0.

Suggested Citation

  • Bayi Cheng & Shanlin Yang & Xiaoxuan Hu & Kai Li, 2014. "Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(3), pages 571-578.
    • Handle: RePEc:taf:tsysxx:v:45:y:2014:i:3:p:571-578
    DOI: 10.1080/00207721.2012.724107
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2012.724107
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2012.724107?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. B.‐Y. Cheng & J.Y.‐T. Leung & K. Li & S.‐L. Yang, 2015. "Single batch machine scheduling with deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(6), pages 470-482, September.
    2. Jianming Dong & Xueshi Wang & Jueliang Hu & Guohui Lin, 2016. "An improved two-machine flowshop scheduling with intermediate transportation," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1316-1334, April.
    3. Cheng, Ba-Yi & Leung, Joseph Y-T. & Li, Kai, 2017. "Integrated scheduling on a batch machine to minimize production, inventory and distribution costs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 104-112.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:45:y:2014:i:3:p:571-578. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.