New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance

Feng Li, Shifu Xu and Zhou Xu

European Journal of Operational Research, 2023, vol. 306, issue 1, 127-140

Abstract: The problem of integrated production and transportation scheduling, commonly faced by make-to-order manufacturers under a commit-to-delivery business mode, is known to be strongly NP-hard. In this study, we propose two new exact algorithms to solve the problem with order acceptance decisions also taken into account. These algorithms can achieve polynomial or pseudo-polynomial running times in several practical situations. We also develop the first pseudo-polynomial time approximation scheme for this problem. It not only guarantees a worst-case performance ratio of (1+ϵ) for any fixed ϵ>0, but also achieves good computational performance.

Keywords: Scheduling; Integrated production and transportation; Commit-to-delivery; Order acceptance; Exact and approximation algorithms (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221722005835
Full text for ScienceDirect subscribers only

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:eee:ejores:v:306:y:2023:i:1:p:127-140

DOI: 10.1016/j.ejor.2022.07.030

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().