IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i19p7077-7089.html
   My bibliography  Save this article

Optimal promise time for customer orders in imperfect discrete production systems with earliness and lateness penalties

Author

Listed:
  • Omar G. Alsawafy
  • Shokri Z. Selim

Abstract

Discrete production systems are very common in industry. This paper studies the case where the system may generate imperfect units and rework is performed immediately before starting a new unit. These systems have not received enough attention in the existing literature. We consider make-to-order imperfect discrete production systems where the manufacturer quotes the customer a promise time for delivering the ordered quantity. This is a very realistic problem that arises often in practice. The random occurrence of imperfect units results in a huge number of possible outcomes. This difficulty is resolved by defining new quantities, and success times, which are possible points of time where an imperfect unit could be generated. These quantities are used efficiently to compute the probability of having a given number of perfect units in a given time, which in turn is used in determining the optimal promise time that minimises the costs associated with late and early production of the demand. This paper examines three cases: imperfect rework, perfect rework, and non-reworkable/scrapped units. It is expected that this work will generate interest in this type of production system.

Suggested Citation

  • Omar G. Alsawafy & Shokri Z. Selim, 2025. "Optimal promise time for customer orders in imperfect discrete production systems with earliness and lateness penalties," International Journal of Production Research, Taylor & Francis Journals, vol. 63(19), pages 7077-7089, October.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:19:p:7077-7089
    DOI: 10.1080/00207543.2025.2492750
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2025.2492750
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2025.2492750?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

    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:tprsxx:v:63:y:2025:i:19:p:7077-7089. 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/TPRS20 .

    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.