IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v51y2019i7p729-743.html
   My bibliography  Save this article

Bernoulli serial lines with batching machines: Performance analysis and system-theoretic properties

Author

Listed:
  • Jun-Qiang Wang
  • Fei-Yi Yan
  • Peng-Hao Cui
  • Chao-Bo Yan

Abstract

Aiming at Bernoulli serial lines with batching machines and finite buffers, this study develops analytical methods for performance analysis and system-theoretic properties. Batching machines can process several jobs simultaneously as a batch, as long as the number of jobs in a batch does not exceed the machine’s batch capacity. The batch capacities of all machines are not necessarily equal. Batching machines bring about a new characteristic of state transitions depending on batch capacities and machine states. For two-machine lines, the joint impacts of batching machines on state transitions are analyzed. Theoretically, the state transition rules are revealed. Based on the state transition rules, this study proposes a hierarchical state transition diagram, proves the ergodicity condition, and derives analytical formulas to evaluate the performance measures. Then, for multi-machine lines, this study develops a computationally efficient aggregation method with high accuracy. Furthermore, the impacts of system parameters, including machine efficiency pattern, batch capacity pattern, batch capacity mismatch, and system size, on the accuracy are qualitatively analyzed. Finally, this study investigates the reversibility and monotonicity properties. These analytical methods and results help production managers to scientifically evaluate, accurately predict, and continuously improve Bernoulli serial lines with batching machines.

Suggested Citation

  • Jun-Qiang Wang & Fei-Yi Yan & Peng-Hao Cui & Chao-Bo Yan, 2019. "Bernoulli serial lines with batching machines: Performance analysis and system-theoretic properties," IISE Transactions, Taylor & Francis Journals, vol. 51(7), pages 729-743, July.
    • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:7:p:729-743
    DOI: 10.1080/24725854.2018.1519745
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2018.1519745
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2018.1519745?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. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    2. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.

    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:uiiexx:v:51:y:2019:i:7:p:729-743. 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/uiie .

    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.