IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i9p1571-1578.html
   My bibliography  Save this article

Batching and resource allocation decisions on an m-machine proportionate flowshop

Author

Listed:
  • Daniel Oron

Abstract

This article considers an m-machine proportionate flowshop scheduling problem where each stage of production consists of a batching operation. Moreover, we assume that the job processing times are controllable through the allocation of a non-renewable resource. The objective consists of minimising the makespan. The scheduler’s task consists of (1) allocating jobs to batches; (2) scheduling batches on the m-machine flowshop; (3) allocating resources to batches; and (4) allocating the resources within each batch to jobs. We show that there exists an optimal solution to the problem that consists of sequencing the jobs in Λ-shape order based on their workloads. Furthermore, the jobs that are sorted in non-decreasing order of workload are scheduled in batches of equal size, whereas the remaining jobs are allocated to batches of different sizes. We present an O(n2) time algorithm based on the observation that all jobs scheduled in the first segment of the Λ-shape have workloads that are smaller than (or equal to) that of the last job in the sequence.

Suggested Citation

  • Daniel Oron, 2019. "Batching and resource allocation decisions on an m-machine proportionate flowshop," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(9), pages 1571-1578, September.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:9:p:1571-1578
    DOI: 10.1080/01605682.2018.1495996
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1495996
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1495996?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.

    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:tjorxx:v:70:y:2019:i:9:p:1571-1578. 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/tjor .

    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.