IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v34y2019i2p301-320.html
   My bibliography  Save this article

Customer's order acceptance and scheduling to maximise total profit

Author

Listed:
  • Mehdi Fazeli-Kebria
  • Ghasem Moslehi
  • Naser Mollaverdi
  • Mohammad Reisi-Nafchi

Abstract

In this paper, in order to maximise total profit, the order acceptance and scheduling problem was generalised by considering some customers with their own orders who do not agree with partial rejection/acceptance of them. Therefore, it was assumed that accepting or rejecting one customer is equal to accepting or rejecting all his orders. In addition, the considered penalty function for scheduling the orders was total weighted lateness. A mathematical programming model, an upper bound, a branch and bound, and an efficient heuristic algorithm were proposed for this problem. It was shown that before starting the problem solving procedure, it is possible to certainly reject or accept some customers. The proposed branch and bound algorithm solved 93% of 810 randomly designed problem instances in a reasonable time. Besides, the heuristic algorithm solved the problem instances with the size of 2,000 customers at most with 0.1% deviation from a lower bound.

Suggested Citation

  • Mehdi Fazeli-Kebria & Ghasem Moslehi & Naser Mollaverdi & Mohammad Reisi-Nafchi, 2019. "Customer's order acceptance and scheduling to maximise total profit," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 34(2), pages 301-320.
    • Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:301-320
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=97580
    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.

    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:ijores:v:34:y:2019:i:2:p:301-320. 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=170 .

    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.