IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v9y2015i5p664-691.html
   My bibliography  Save this article

Two-agent order acceptance and scheduling to maximise total revenue

Author

Listed:
  • Mohammad Reisi-Nafchi
  • Ghasem Moslehi

Abstract

The order acceptance and scheduling problem has attracted the attention of many researchers over the past two decades. Studies dealing with profit calculation in this problem have so far focused only on one type of penalty function. This is while in real life situations each manufacturer can have different customers and may deal with each individual customer through different objective functions. In this paper, the order acceptance and scheduling problem has been redefined as a two-agent case for which a new and more practical problem has been considered. The objective is maximising the total revenue from accepted orders by considering an upper bound on the total lateness of the first agent's orders and no tardy orders of the second. A mathematical programming model and a pseudo-polynomial dynamic programming are proposed to optimally solve the problem. Computational results for this problem have shown the capability of the proposed approach. [Received 12 April 2013; Revised 12 January 2014; Revised 3 June 2014; Accepted 18 August 2014]

Suggested Citation

  • Mohammad Reisi-Nafchi & Ghasem Moslehi, 2015. "Two-agent order acceptance and scheduling to maximise total revenue," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 9(5), pages 664-691.
    • Handle: RePEc:ids:eujine:v:9:y:2015:i:5:p:664-691
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=71776
    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. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.

    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:eujine:v:9:y:2015:i:5:p:664-691. 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=210 .

    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.