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

Venkata Prasad Palakiti, Usha Mohan and Viswanath Kumar Ganesan

European Journal of Industrial Engineering, 2018, vol. 12, issue 4, 535-557

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]

Keywords: order acceptance; scheduling; parallel machines; branch and bound algorithm; B%B. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=93631 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:12:y:2018:i:4:p:535-557

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().