Title: Order acceptance and scheduling: overview and complexity results

Authors: Venkata Prasad Palakiti; Usha Mohan; Viswanath Kumar Ganesan

Addresses: Department of Management Studies, Indian Institute of Technology Madras, Chennai, 600036, India ' Department of Management Studies, Indian Institute of Technology Madras, Chennai, 600036, India ' Decision Science and Algorithm Lab, Tata Consultancy Systems Limited, Chennai, 600036, India

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.

Keywords: complexity; order acceptance; scheduling; due dates.

DOI: 10.1504/IJOR.2019.098312

International Journal of Operational Research, 2019 Vol.34 No.3, pp.369 - 386

Received: 29 Dec 2015
Accepted: 08 Apr 2016
Published online: 14 Mar 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article