Submitted:
25 June 2026
Posted:
26 June 2026
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Literature Review
3. Materials and Methods
- Class 1: Low priority
- Class 2: Normal priority
- Class 3: High priority

3.1. Listing of Selection Attributes
- Order quantity: This attribute referred to the total quantity within the relevant sales order. In this study, an order was considered an MTS order if it originated from a forecast, and an MTO order if it was customer-dependent.
- Order due date: For MTO orders, this attribute referred to the delivery date of the relevant sales order. For MTS orders, it referred to the forecasted delivery date of the corresponding forecast value. In this study, the delivery date was expressed in weeks.
- Order frequency: This attribute referred to the recurrence frequency of an order. It was calculated as a percentage over the determined period.
- Production cost: This attribute was considered at the order level and referred to the unit production cost of the relevant order.
- Value < 0,00: No agreement
- 0,00–0,20: Slight agreement
- 0,21–0,40: Fair agreement
- 0,41–0,60: Moderate agreement
- 0,61–0,80: Substantial agreement
- 0,81–1,00: Almost perfect agreement

3.2. Order Evaluation Stage
- All accepted orders were produced.
- Capacity overruns were not allowed.
- Capacity did not vary by product type.
- Capacity was defined on a periodic basis.
- An order could belong to only one class.
- MTO orders were indivisible, and production was carried out within a single period.
- MTO orders were produced in the period in which they arrived (no inventory was held).
- MTS orders were divisible.
- Inventory carryover was allowed for MTS orders.
- Capacity constraints were structured in a hierarchical manner based on a three-level priority classification (low, normal, and high priority), thereby mathematically ensuring that high-priority orders had prioritized access to available capacity.
- A holding cost was incurred for the amount of MTS inventory carried over to the subsequent period.
- Dates referred to the delivery date for MTO orders and the requirement date for MTS orders.
- : Number of accepted MTO orders
- : Number of non-accepted MTO orders
- : Quantity of the MTS order produced in the period,
- : Unmet quantity of the MTS order for the period,
- : Remaining capacity quantity after the priority class in the period.
| Indices | Description |
|---|---|
| i ϵ O | Set of MTO orders |
| j ϵ S | Set of MTS orders |
| c ϵ K | Priority classes (1;2; 3) |
| t ϵ L | Periods |
| Parameters | |
| w(c) | Benefit coefficient for MTO orders in priority class c |
| m(c) | Penalty coefficient for MTO orders in priority class c |
| d(i) | Delivery period of MTO order i |
| Qi | Quantity of MTO order i |
| a(i) | Unit production cost of MTO order i |
| F(j,t) | Planned requirement of MTS order j in period t |
| a'(j) | Unit production cost of MTS order j |
| h(j) | Unit holding cost per period for MTS order j |
| P(j,0) | Initial inventory of MTS order j (at the end of period 0) |
| w'(c) | Benefit coefficient for MTS orders in priority class c |
| CT(t) | Total capacity of period t |
| BD(t) | Budget of period t |
| Variables | |
| X(i,c,t) | 1, if MTO order i is produced and accepted in period t; 0, otherwise |
| X'(j,c,t) | Quantity of MTS order j produced in period t |
| P(j,t) | End-of-period inventory (surplus) of MTS order j in period t |
| N(j,t) | Cumulative backlog of MTS order j at the end of period t |
| R(c,t) | Remaining capacity in period t after consumption by priority class c |
- Delivery date modification: In order to reduce the delivery time of a specific order, a company might often need to reject or delay other orders. Rejecting or delaying orders could result in costs such as late delivery penalties or damage to the company's reputation. Therefore, an economic evaluation needed to be conducted between the benefit of reducing the delivery time of one order and the costs of rejecting or delaying other orders. When negotiating the delivery date, the company needed to minimize the probability of delay. This probability could be assessed by examining the company's operational process capacity, its past performance in meeting delivery dates, the availability of resources (machinery, materials, or labor), and the current workload in the production area [5].
- Order price modification: The company could shorten the delivery time by increasing the order price. Similarly, order prices could be reduced in exchange for extending delivery times [5].
- Order quantity modification: The entire quantity specified in an order might not be deliverable by the requested delivery date. In this case, the order quantity could be planned by splitting it across different periods. If earlier production was planned, a holding cost would be incurred. If holding costs were not desired, partial shipment would occur instead.
- Capacity modification: If the model under consideration involved multiple periods, infeasible orders could be planned for periods with lower capacity utilization. In this case, a change in the delivery date for the relevant order or orders would be required. If a date change was not feasible, overtime work could be implemented, or outsourcing could be considered. In this case, an increase in the operational cost of the order would occur. Therefore, the company needed to calculate the resulting additional costs and incorporate them into the order price [5].
- MTO-focused: Customer satisfaction was prioritized, and the acceptance of as many MTO orders as possible was desired. In this case, the following coefficients could be used:
| w(c) | w'(c) | m(c) | |
| c=1 | 4 | 1 | 1 |
| c=2 | 5 | 2 | 2 |
| c=3 | 6 | 3 | 3 |
- Z maximization-focused: Total benefit was prioritized, while the MTS/MTO balance remained secondary. In this case, the following coefficients could be used:
| w(c) | w'(c) | m(c) |
| 1 | 1 | 1 |
| 3 | 3 | 2 |
| 9 | 9 | 3 |
- Balanced: A balance was established between MTO acceptance and total benefit, with the base scenario (S1) taken as a reference. In this case, the following coefficients could be used:
| w(c) | w'(c) | m(c) | |
| c=1 | 1 | 1 | 1 |
| c=2 | 2 | 2 | 2 |
| c=3 | 3 | 3 | 3 |
4. An Actual Evaluation
4.1. Development of ML Models for Classification
- Cohen’s kappa for “Base model vs RF model”: 0,27,
- Cohen’s kappa for “Base model vs SVM model”: 0,18,
- Cohen’s kappa for “Base model vs KNN model”: 0,27.
5. Results of the Mathematical Model
| w(c) | w'(c) | m(c) |
| 4 | 1 | 1 |
| 5 | 2 | 3 |
| 6 | 3 | 9 |
- The objective function value (Z) was obtained as 70.010.231.
- Due to the long computational time, the solver was run with a tolerance of at most 0.1% deviation from the optimal solution. This approach kept the computation time within practical limits while maintaining an acceptable level of solution quality.
- The number of accepted MTO orders was 1458, whereas 331 orders were rejected. Consequently, the acceptance rate was 81.50%.
- The full capacity was utilized in each period, and the period capacity was set at 3.000.000 units.
- The total order quantities by period were presented in Table 11.
6. Conclusions and Future Works
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
Abbreviations
| MTS | Make-to-Stock |
| MTO | Make-to-Order |
| ML | Machine Learning |
| RF | Random Forest |
| SVM | Support Vector Machine |
| KNN | K-Nearest Neighbors |
References
- Abedi, A.; Zhu, W. An advanced order acceptance model for hybrid production strategy. Journal of Manufacturing Systems 2020, 55, 82–93. [CrossRef]
- Peeters, K.; van Ooijen, H. Hybrid make-to-stock and make-to-order systems: a taxonomic review. International Journal of Production Research 2020, 58(15), 4659–4688. [CrossRef]
- Beemsterboer, B.; Land, M.; Teunter, R. Hybrid MTO-MTS production planning: An explorative study. European Journal of Operational Research 2016, 248(2), 453–461. [CrossRef]
- Rabbani, M.; Monshi, M.; Manavizadeh, N.; and Jalali, M.S. Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighted earliness/tardiness cost, Int. J. Ind. Eng. Comput., 2016, (7), 451–462. [CrossRef]
- Kalantari, M., Rabbani, M., & Ebadian, M. A decision support system for order acceptance/rejection in hybrid MTS/MTO production systems. Applied Mathematical Modelling 2011, 35(3), 1363–1377. [CrossRef]
- Wester, F. A. W.; Wijngaard, J.; Zijm, W. R. M. Order acceptance strategies in a production-to-order environment with setup times and due-dates. International Journal of Production Research 1992, 30(6), 1313–1326. [CrossRef]
- Kilic, O. A.; van Donk, D. P.; Wijngaard, J.; Tarim, S. A. Order acceptance in food processing systems with random raw material requirements. OR Spectrum 2010, 32(4), 905–925. [CrossRef]
- Ashayeri, J.; Selen, W. J. Order selection optimization in hybrid make-to-order and make-to-stock markets. Journal of the Operational Research Society 2001, 52(10), 1098–1106. [CrossRef]
- Rafiei, H.; Rabbani, M. Capacity coordination in hybrid make-to-stock/make-to-order production environments. International Journal of Production Research 2012, 50(3), 773–789. [CrossRef]
- Kapadia, M. S.; Uzsoy, R.; Starly, B.; Warsing, D. P. A genetic algorithm for order acceptance and scheduling in additive manufacturing. International Journal of Production Research 2021, 60(21), 6373–6390. [CrossRef]
- Wang, H.-K.; Mönch, L. A matheuristic for making order acceptance decisions in multi-product, multi-stage manufacturing systems. Applied Soft Computing 2021, 111, 107640. [CrossRef]
- Wang, Z.; Qi, Y.; Cui, H.; and Zhang, J. A hybrid algorithm for order acceptance and scheduling problem in make-to-stock/make-to-order industries. Comput. Ind. Eng. 2019, 127, February, 841–852. [CrossRef]
- Renna, P. Comparison of Dynamic Decoupling Point and Dynamic Buffer Level for Flexible Flow Shops in a Hybrid MTS–MTO Production Model. Applied Sciences 2024, 14(17), 7975. [CrossRef]
- Soman, C. A.; Van Donk, D. P.; Gaalman, G. Combined make-to-order and make-to-stock in a food production system. International Journal of Production Economics 2004, 90(2), 223–235. [CrossRef]
- Manavizadeh, N.; Hasani Goodarzi, A.; Rabbani, M.; Jolai, F. Order acceptance/rejection policies in determining the sequence in mixed model assembly lines. Applied Mathematical Modelling 2013, 37(4), 2531–2551. [CrossRef]
- Ziaee, M.; Mortazavi, J.; Amra, M. Flexible job shop scheduling problem considering machine and order acceptance, transportation costs, and setup times. Soft Computing 2021. 26(7), 3527–3543. [CrossRef]
- Wang, J.; Yang, J. Q.; and Lee, H. Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach. Math. Comput. Model., 1994. 19(5), 1–19. [CrossRef]
- Arredondo, F., & Martinez, E. Learning and adaptation of a policy for dynamic order acceptance in make-to-order manufacturing. Computers and Industrial Engineering 2010, 58(1), 70–83. [CrossRef]
- Wei, J.; Ma, Y. S. Design of a feature-based order acceptance and scheduling module in an ERP system. Computers in Industry 2014, 65(1), 64–78. [CrossRef]
- Kuo, R. J.; Chen, J. A. A decision support system for order selection in electronic commerce based on fuzzy neural network supported by real-coded genetic algorithm. Expert Systems with Applications 2004, 26(2), 141–154. [CrossRef]
- Kuthambalayan, T. S.; Bera, S. Managing product variety with mixed make-to-stock/make-to-order production strategy and guaranteed delivery time under stochastic demand. Comput. Ind. Eng. 2020. 147(106603). June 2019. [CrossRef]
- Silver, E. A.; Pyke, D. F. and Thomas, D. J. Inventory and Production Management in Supply Chains, 4th ed. USA: CRC Press, Boca Raton, FL, 2017.
- Nahmias S., and Olsen, T. L. Production and Operations Analysis, 7th ed. USA: Waveland Press, Long Grove, IL, 2015.


| Stage | Description | Applied Method |
|---|---|---|
| Order Classification | Orders were classified into priority classes based on their attributes. | Machine learning algorithm |
| Order Evaluation | From the classified orders, those that were feasible under the constraints were identified. | Mathematical model |
| Attribute | Reference |
|---|---|
| Order Quantity | Wang vd, [17] Arredondo and Martinez [18] Wei and Ma [19] |
| Order Due Date | Wester vd, [6] Wang vd, [17] Kuo and Chen [19] Arredondo and Martinez [18] Kalantari vd, [5] Wei and Ma [19] |
| Order Frequency | Kalantari vd [5] Wei and Ma [19] |
| Production Cost | Ashayeri and Selen [8] Rafiei and Rabbani [9] Abedi and Zhu [1] Kuthambalayan and Bera [21] |
| Scenario | Number of orders | MTO | MTS | Period | Pj0 | Description | Solution time (s) |
|---|---|---|---|---|---|---|---|
| S1 | 500 | 165 | 335 | 1 | 0 | Model validation | 0,031 |
| S2 | 1000 | 330 | 670 | 1 | 0 | Weekly planning - Small company | 0,062 |
| S3 | 5000 | 1650 | 3350 | 1 | 0 | Weekly planning - Large company | 0,338 |
| S4 | 5000 | 1650 | 3350 | 4 | 0 | Monthly plan | 1,957 |
| S5 | 10000 | 3300 | 6700 | 4 | 0 | Monthly plan - Large company | 2,221 |
| S6 | 10000 | 3300 | 6700 | 12 | >0 | Quarterly planning | 13,987 |
| S7 | 10000 | 3300 | 6700 | 52 | >0 | Annual planning | 1423,194 |
| S8 | 50000 | 16500 | 33500 | 1 | 0 | Large Scale – Single Period | 1,919 |
| S9 | 50000 | 16500 | 33500 | 12 | >0 | Large Scale – Quarterly | 152,754 |
| S10 | 50000 | 16500 | 33500 | 52 | >0 | Annual Period Upper Limit | NA |
| S11 | 100000 | 33000 | 67000 | 1 | 0 | Single Period Limit | 24,608 |
| S12 | 250000 | 82500 | 167500 | 1 | 0 | Single Period Limit | 191,78 |
| S13 | 500000 | 165000 | 335000 | 1 | 0 | Single Period Limit | 760,166 |
| S14 | 1000000 | 330000 | 670000 | 1 | 0 | Single Period Limit | 3829,094 |
| S15 | 1500000 | 495000 | 1005000 | 1 | 0 | Single Period Limit | 9219,865 |
| S16 | 1995000 | 990000 | 1005000 | 1 | 0 | Single Period Upper Limit | NA |
| Scenario | Description | w(c) | w’(c) | m(c) | MTO acceptance rate | Objective Function Value (Z) |
|---|---|---|---|---|---|---|
| S1 | Base Scenario | 1-2-3 | 1-2-3 | 1-2-3 | 57% | 249946,5 |
| S2 | Narrow Benefit Difference | 1-1,5-2 | 1-1,5-2 | 1-2-3 | 100% | 166644,5 |
| S3 | Wide Benefit Difference | 1-3-9 | 1-3-9 | 1-2-3 | 23% | 749700,5 |
| S4 | Low Penalty | 1-2-3 | 1-2-3 | 1-1,5-2 | 57% | 249946,5 |
| S5 | High Penalty | 1-2-3 | 1-2-3 | 1-3-9 | 57% | 249946,5 |
| S6 | High Benefit and High Penalty | 1-3-9 | 1-3-9 | 1-3-9 | 23% | 749688,5 |
| S7 | MTO Prioritized | 4-5-6 | 1-2-3 | 1-2-3 | 100% | 250044 |
| S8 | MTS Prioritized | 1-2-3 | 1-3-9 | 1-2-3 | 0% | 749664,5 |
| S9 | Increased Penalty Coefficient | 1-2-3 | 1-3-9 | 1-9-27 | 57% | 749610,5 |
| S10 | Proportional Balance | 1-3-9 | 1-3-9 | 1-3-9 | 23% | 749688,5 |
| Subset | Fleiss' kappa coefficient |
|---|---|
| 10% subset | 0,67 |
| 20% subset | 0,74 |
| 30% subset | 0,77 |
| Attribute | Threshold 1 | Threshold 2 |
|---|---|---|
| Order quantity | 312 | 4100 |
| Order frequency | 6,36 | 40,86 |
| Due date | 2 | 4 |
| Variation | Fleiss' kappa coefficient |
|---|---|
| - 5 % | 0,85 |
| - 10% | 0,7 |
| + 5% | 0,87 |
| ML Model | Accuracy Score | Std Dev |
|---|---|---|
| SVM | 0,83 | 0,01 |
| KNN | 0,83 | 0,02 |
| RF | 0,86 | 0,01 |
| ML Model | Class | Precision | Recall | F1-score | Class Percentage % |
|---|---|---|---|---|---|
| RF | 1 | 0,66 | 0,55 | 0,60 | 5,35 |
| RF | 2 | 0,90 | 0,89 | 0,90 | 68,46 |
| RF | 3 | 0,76 | 0,85 | 0,80 | 26,19 |
| SVM | 1 | 0,00 | 0,00 | 0,00 | 0,00 |
| SVM | 2 | 0,85 | 0,92 | 0,88 | 75,59 |
| SVM | 3 | 0,76 | 0,78 | 0,77 | 24,41 |
| KNN | 1 | 0,57 | 0,46 | 0,51 | 5,12 |
| KNN | 2 | 0,88 | 0,88 | 0,88 | 70,13 |
| KNN | 3 | 0,75 | 0,79 | 0,77 | 24,75 |
| t | Total Qi | X(i,t) * Total Qi |
Total Fj | Total Yj | Total Production |
Total Requirement |
|---|---|---|---|---|---|---|
| 1 | 41106 | 20348 | 2640216 | 1967349 | 1987697 | 2681322 |
| 2 | 41106 | 41106 | 1536459 | 1536459 | 1577565 | 1577565 |
| 3 | 1944413 | 1430429 | 119863 | 1198639 | 2629068 | 2064276 |
| 4 | 0 | 0 | 1071210 | 1071210 | 1071210 | 1071210 |
| 5 | 0 | 0 | 2524868 | 1858160 | 1858160 | 2524868 |
| 6 | 3186 | 3186 | 1581411 | 1581411 | 1584597 | 1584597 |
| 7 | 1425538 | 1123489 | 1419605 | 1418777 | 2542266 | 2845143 |
| 8 | 621844 | 621844 | 1363119 | 1363119 | 1984963 | 1984963 |
| 9 | 0 | 0 | 2379518 | 1554017 | 1554017 | 2379518 |
| 10 | 0 | 0 | 1549605 | 1549605 | 1549605 | 1549605 |
| 11 | 1452551 | 1230397 | 1656713 | 857690 | 2088087 | 3109264 |
| 12 | 498630 | 458580 | 1205917 | 1013072 | 1471652 | 1704547 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).