Order acceptance and scheduling: overview and complexity results

Venkata Prasad Palakiti, Usha Mohan and Viswanath Kumar Ganesan

International Journal of Operational Research, 2019, vol. 34, issue 3, 369-386

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. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=98312 (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:ijores:v:34:y:2019:i:3:p:369-386

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().