IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v41y2022i2p254-275.html
   My bibliography  Save this article

A single-stage batch scheduling model with m heterogeneous batch processors producing multiple items parts demanded at different due dates

Author

Listed:
  • Nita P.A. Hidayat
  • Andi Cakravastia
  • Wisnu Aribowo
  • Abdul Hakim Halim

Abstract

This research deals with a batch scheduling problem to minimise total actual flowtime of parts through the shop with m heterogeneous batch processors, i.e., the machine simultaneously processing all parts in a batch. The parts to be processed are multiple items, and the completed parts must be delivered at different due dates. The total actual flow time of parts can be defined as an interval between arrival times of the parts and their respective due dates. The objective of minimising the total actual flowtime is not only to satisfy the due dates as a commitment to the customers, but also to minimise the length of total time spent by the parts in the shop. The problem is formulated as a mathematical model and an algorithm to solve the problem is proposed. Numerical examples show that the proposed algorithm can effectively solve the problem.

Suggested Citation

  • Nita P.A. Hidayat & Andi Cakravastia & Wisnu Aribowo & Abdul Hakim Halim, 2022. "A single-stage batch scheduling model with m heterogeneous batch processors producing multiple items parts demanded at different due dates," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 41(2), pages 254-275.
    • Handle: RePEc:ids:ijisen:v:41:y:2022:i:2:p:254-275
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=123576
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Li-Han Zhang & Dan-Yang Lv & Ji-Bo Wang, 2023. "Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs," Mathematics, MDPI, vol. 11(12), pages 1-12, June.

    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:ids:ijisen:v:41:y:2022:i:2:p:254-275. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.