Order acceptance and scheduling in a parallel machine environment with weighted completion time
by Venkata Prasad Palakiti; Usha Mohan; Viswanath Kumar Ganesan
European J. of Industrial Engineering (EJIE), Vol. 12, No. 4, 2018

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]

Online publication date: Mon, 30-Jul-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com