This paper examines an online integrated production and transportation scheduling problem in a make-to-order environment with time-dependent waiting and inventory holding costs. In this problem, the manufacturer has to produce the orders arriving over time and then deliver them to customers, resulting in production costs and transportation costs associated with the number of vehicles used. If orders are not immediately produced or transported upon arrival, waiting costs will be incurred during the interval between order receipt and transportation, along with inventory holding costs for storing products preceding their transportation will be incurred. The objective is to minimize the total cost of production, waiting, inventory holding, and transportation. We propose a primal–dual based heuristic algorithm with a competitive ratio of 3 and establish a lower bound of 2 on the competitiveness of any deterministic online algorithm for the problem. Furthermore, we investigate a general problem with considering both limited production capacity and fixed-plus-linear production cost structures.
Zhu, Yuejuan, Liu, Zhixue, Li, Feng et al. Online integrated production–transportation in a make-to-order environment. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-025-00866-9. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-025-00866-9
Zhu, Yuejuan, Liu, Zhixue, Li, Feng, Wang, & Julong (2026). Online integrated production–transportation in a make-to-order environment. Journal of Scheduling. https://doi.org/10.1007/s10951-025-00866-9
Zhu, et al. “Online integrated production–transportation in a make-to-order environment.” Journal of Scheduling, 2026. doi:10.1007/s10951-025-00866-9.
@article{Zhu2026,
title = {Online integrated production–transportation in a make-to-order environment},
author = {Zhu and Yuejuan and Liu and Zhixue and Li and Feng and Wang and Julong},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-025-00866-9},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-025-00866-9}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...