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

Order acceptance and scheduling in a parallel machine environment with weighted completion time

Author

Listed:
  • Venkata Prasad Palakiti
  • Usha Mohan
  • Viswanath Kumar Ganesan

Abstract

This paper studies the order acceptance and scheduling (OAS) problem in an identical parallel machine environment where orders are characterised by their revenues, processing times and weights. A mixed integer linear programming (MILP) model is presented for the problem with the objective of maximising the revenue minus the scheduling cost. The problem is NP- hard and a branch and bound (B%B) algorithm is developed to solve the problem. An extension of the B%B algorithm is proposed to solve very large problem instances to obtain ε-optimal solutions. The B%B algorithm and the extended B%B are evaluated for their performances against the solutions obtained by solving the MILP problem formulation using CPLEX solver through computational experiments. [Received 15 June 2017; Revised 2 February 2018; Accepted 10 March 2018]

Suggested Citation

  • Venkata Prasad Palakiti & Usha Mohan & Viswanath Kumar Ganesan, 2018. "Order acceptance and scheduling in a parallel machine environment with weighted completion time," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 12(4), pages 535-557.
    • Handle: RePEc:ids:eujine:v:12:y:2018:i:4:p:535-557
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=93631
    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:eujine:v:12:y:2018:i:4:p:535-557. 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.