Order acceptance and scheduling: overview and complexity results
by Venkata Prasad Palakiti; Usha Mohan; Viswanath Kumar Ganesan
International Journal of Operational Research (IJOR), Vol. 34, No. 3, 2019

Abstract: The order acceptance and scheduling (OAS) problem is an important aspect of the manufacturing process, especially when production is carried out on a made-to-order basis with stringent deadlines and limited production capacity. This paper provides an overview of existing OAS problems by considering due date related dimensions in deterministic scenarios. A three-field notation was introduced for classifying OAS problems, and reviewing solution algorithms and complexity results for the same. This research effort proved the complexity results for existing, open as well as new OAS problems with due dates, and additionally, outlined the complexity results for newly defined OAS problems without due date dimensions.

Online publication date: Thu, 14-Mar-2019

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 International Journal of Operational Research (IJOR):
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