Submit a Manuscript to the Journal

International Journal of Production Research

For a Special Issue on

Innovations in Production Planning: Emerging Problems and Modern Solution Paradigms

Manuscript deadline

Special Issue Editor(s)

Mirco Peron [Managing Guest Editor], NEOMA Business School, France
[email protected]

Ibrahim Kucukkoc, Balikesir University, Turkey
[email protected]

Daniel Alejandro Rossit, Universidad Nacional del Sur, Argentina
[email protected]

Ilkyeong Moon, Seoul National University, South Korea
[email protected]

Olga Battaïa, KEDGE Business School, France
[email protected]

Michael Pinedo, Stern School of Business, New York University, USA (
[email protected]

Journal information

Submit an article to International Journal of Production ResearchView International Journal of Production Research on Taylor & Francis OnlineRead the Instructions for Authors on International Journal of Production Research

Innovations in Production Planning: Emerging Problems and Modern Solution Paradigms

Production planning has historically been a central pillar of industrial engineering and operations management. Since the mid-20th century, the field has developed a rich body of classical problems and models, such as lot sizing, job shop and flow shop scheduling, capacity planning, assembly line balancing, material requirements planning (MRP), and aggregate production planning (Pinedo, 2016; Battaïa and Dolgui, 2013; Battaïa and Dolgui, 2022; Boysen et al., 2022). These models provided structured ways to allocate resources, balance supply and demand, and coordinate activities across production systems, often under deterministic assumptions and with objectives focused primarily on cost and efficiency. Linear programming, dynamic programming, and combinatorial optimization offered rigorous formulations and exact methods, while heuristics and metaheuristics emerged to address large-scale and computationally complex instances (e.g., Aspern et al., 2025; Hermelin et al., 2025; Kucukkoc et al., 2023).

Over time, production planning research progressively expanded to address uncertainty (via stochastic and robust optimization), multi-objective trade-offs (e.g. cost, service level, inventory, lead times), and integration across planning levels (strategic, tactical, and operational) (Lee and Moon, 2025; Huang et al., 2024; Wang et al., 2026). Still, the focus remained on well-defined, structured problems and a relatively stable industrial context (e.g., Lee and Moon, 2024).

Today, however, technological, environmental, and societal shifts are reshaping the landscape of production planning. The rise of cyber-physical systems, IoT-enabled factories, advanced robotics, digital twins, additive manufacturing, and AI-based automation has disrupted the stability of traditional assumptions (Yilmaz et al., 2026; Cakici et al., 2024; Kucukkoc et al., 2025; Battaïa et al., 2025). These innovations have created new types of planning problems, characterized by more frequent reconfiguration, increased heterogeneity of resources, and the necessity of integrating multiple technologies and objectives. For instance:

  • Digital twin–driven planning enables real-time updates of plans and schedules, requiring adaptive and rolling-horizon optimization (e.g., Rodriguez and Rossit, 2025; Dolgui et al., 2025; Dolgui and Ivanov, 2021).
  • Hybrid production systems, combining conventional and additive manufacturing, pose new challenges in sequencing, capacity allocation, and cross-technology coordination (e.g., Cantini et al., 2022; Kucukkoc et al., 2025; Cakici et al., 2025; Lolli et al., 2025).
  • Reconfigurable and modular manufacturing requires planning models that adapt to changing system topologies, dynamic routing, and flexible resource reassignments (e.g., Battaïa et al., 2025).
  • Circular and sustainable production systems demand that environmental and social objectives be embedded in planning alongside economic goals (e.g., Peron et al., 2025; Kucukkoc, 2024).
  • Resilience-oriented planning has become critical in the face of global disruptions, pandemics, and supply shocks, demanding strategies that balance efficiency with adaptability and robustness (e.g., Lee and Moon, 2025; Dolgui and Ivanov, 2021).

At the same time, innovation has not only transformed the problems but also the solution approaches. Whereas traditional production planning was dominated by mathematical programming and rule-based heuristics, the current era witnesses the rapid adoption of data-driven, hybrid, and AI-enabled methods:

  • Reinforcement learning / deep learning models are increasingly applied to dynamic planning and scheduling, e.g., graph neural network and RL architectures for scheduling problems (e.g., Lei et al., 2023; Woo and Moon, 2026; Elyasi et al., 2026; Wang et al., 2026).
  • Hybrid metaheuristics combine classical optimization with machine learning models, surrogate functions, or decomposition techniques to tackle high-dimensional problems (e.g., Khachai et al., 2025; Hermelin et al., 2025; Aspern et al., 2025; Beldar et al, 2025).
  • Simulation–optimization coupling allows planners to test, validate, and adapt decisions under complex system dynamics, particularly in systems where analytical modeling is intractable (e.g., Huang et al., 2024; Lolli et al., 2024; Cantini et al., 2025).
  • Multi-agent and distributed approaches enable decentralized planning in highly connected production networks, where local agents coordinate planning decisions (e.g., Yuraszeck et al., 2025).
  • Online / rolling-horizon algorithms become critical when plans must be revised frequently, and incremental updating is required (e.g., Park and Moon, 2025; Woo and Moon, 2025).

Despite these advances, major challenges persist. Industrial adoption demands bridging the gap between academic models and real-world constraints: data sparsity, computational scalability, integration with legacy systems (ERP/MES), and user trust. Decision-makers must also reconcile conflicting objectives: efficiency vs. resilience, speed vs. sustainability, optimality vs. interpretability.
Against this backdrop, this special issue seeks to collect innovative contributions that redefine the boundaries of production planning. We welcome papers that introduce novel problem formulations reflecting new industrial realities and innovative solution approaches leveraging modern computational, AI, and optimization tools. Both theoretical/methodological and empirical/applied submissions are encouraged, including case studies and empirical validation.

Topics may include (but are not limited to):

  • Evolution of classical planning problems (lot sizing, capacity planning, scheduling, assembly line balancing) in modern manufacturing contexts
  • Planning in reconfigurable, modular, and hybrid manufacturing systems
  • Integration of additive manufacturing and conventional processes in planning
  • Additive manufacturing production scheduling
  • Digital twin–enabled planning and real-time adaptive scheduling
  • Production planning under sustainability, circular economy, emissions or carbon goals
  • Resilience-oriented planning under uncertainty, disruptions, and volatility
  • Advanced optimization methods: decomposition, robust/stochastic models, metaheuristics
  • Machine learning, reinforcement learning, hybrid AI–optimization for planning
  • Simulation–optimization frameworks and surrogate modeling
  • Production Planning problems associated with customized environments (engineering-to-order, make-to-order, mass customization)
  • Human–robot collaborative systems and operator-driven planning in the context of Industry 5.0
  • Reinforcement learning / deep learning models applied to dynamic planning and scheduling, (e.g., graph neural network and RL architectures for scheduling problems)
  • Optimization of production and inventory strategies in modern distribution systems (e.g., e-commerce, platform-based logistics)

References:
Aspern, M. V., Buld, F., Klein, N., & Pinedo, M. (2025). Flow shops with reentry: The total weighted completion time objective. Journal of Scheduling, 1–16.
Battaïa, O., & Dolgui, A. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics, 142(2), 259–277.
Battaïa, O., & Dolgui, A. (2022). Hybridizations in line balancing problems: A comprehensive review on new trends and formulations. International Journal of Production Economics, 250, 108673.
Battaïa, O., Delorme, X., Dolgui, A., & Haddou-Benderbal, H. (2025). New trends in line balancing and model sequencing in assembly, disassembly and machining environments. Computers & Industrial Engineering, 207, 111210.
Beldar, P., Fathi, M., Nourmohammadi, A., Delorme, X., Battaïa, O., & Dolgui, A. (2025). Transfer line balancing problem: A comprehensive review, classification, and research avenues. Computers & Industrial Engineering, 201, 110913.
Boysen, N., Schulze, P., & Scholl, A. (2022). Assembly line balancing: What happened in the last fifteen years? European Journal of Operational Research, 301(3), 797-814.
Cantini, A., Peron, M., De Carlo, F., & Sgarbossa, F. (2022). A decision support system for configuring spare parts supply chains considering different manufacturing technologies. International Journal of Production Research, 62(8), 3023–3043.
Cantini, A., Coruzzolo, A. M., De Carlo, F., Lolli, F., & Peron, M. (2025). Additive or conventional manufacturing for the management of spare parts inventories? The impact of qualification testing. Production Planning & Control, 1-24.
Cakici, E., Kucukkoc, I., & Akdemir, M. (2024). Advanced constraint programming formulations for additive manufacturing machine scheduling problems. Journal of the Operational Research Society, 76(3), 590–605.
Dolgui, A., Ivanov, D., & Lemoine, D. (2025). Special issue: manufacturing modelling, management, and control. Flexible Services and Manufacturing Journal.
Dolgui, A., & Ivanov, D. (2021). Supply chain resilience and digitalization: The “digital supply chain twin.” International Journal of Production Research, 59(7), 1–16.
Elyasi, M., Thevenin, S., Cerqueus, A., & Dolgui, A. (2026). Markov Decision Process for mixed-model assembly line design under process time uncertainty. Omega, 138, 103425.
Hermelin, D., Molter, H., Niedermeier, R., Pinedo, M., & Shabtay, D. (2025). Fairness in repetitive scheduling. European Journal of Operational Research, 323(3), 724-738.
Huang, Y., Fang, W., Dolgui, A., Pi, Y., & Zhang, B. (2024). Combat counterfeits effectively or not? Encroachment and financing strategies with production disruption risk. International Transactions in Operational Research, 33, 415-456
Khachai, D., Battaïa, O., Petunin, A., & Khachay, M. (2025). Discrete cutting path problems: A general solution framework and industrial applications. International Journal of Production Research, 63(3), 949–969.
Kucukkoc, I. (2024). Scheduling of distributed additive manufacturing machines considering carbon emissions, An International Journal of Optimization and Control: Theories & Applications, 14(1), 20–31.
Kucukkoc, I., Aydin Keskin, G., Karaoglan, A. D., & Karadag, S. (2023). A hybrid discrete differential evolution – genetic algorithm approach with a new batch formation mechanism for parallel batch scheduling considering batch delivery. International Journal of Production Research, 62(1–2), 460–482.
Kucukkoc, I., Finco, S., Peron, M., & Aydin Keskin, G. (2025). Including mechanical requirements in a bi-objective nesting and scheduling model for additive manufacturing. European Journal of Operational Research, 325(3), 416-432.
Lee, J., & Moon, I. (2024). A decomposition approach for robust omnichannel retail operations considering the third-party platform channel. Transportation Research Part E: Logistics and Transportation Review, 184, 103466.
Lee, J., & Moon, I. (2025). An integrated model of supply chain resilience considering supply and demand uncertainties. International Transactions in Operational Research, 32(4), 1834–1860.
Lei, K., Guo, P., Wang, Y., Zhang, J., Meng, X., & Qian, L. (2023). Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning. IEEE Transactions on Industrial Informatics, 20(1), 1007–1018.
Lolli, F., Coruzzolo, A. M., Peron, M., & Sgarbossa, F. (2024). Insourcing additive manufacturing for spare parts production: is it profitable? An extensive analysis and the proposal of a Decision Support System. International Journal of Production Research, 63(11), 3961–3981.
Park, J., & Moon, I. (2025). Rental pricing and empty container repositioning strategy for a one-way container rental service. Ocean and Coastal Management, 267, 107684.
Park, K., Jo, S., Shin, Y., & Moon, I. (2025). Flexible material handling system for multi-load autonomous mobile robots in manufacturing environments: A hierarchical reinforcement learning approach. International Journal of Production Research, 63(15), 5671-5691.
Pinedo, M. (2016). Scheduling: Theory, Algorithms, and Systems. Springer.
Peron, M., Panza, L., Demiralay, E., & Talluri, S. (2025). Additive Manufacturing for Spare Parts Management: Is Decentralized Production Always Environmentally Preferable? IEEE Transactions on Engineering Management, 72, 634-650.
Rodriguez, J., & Rossit, D. (2025). Nesting and scheduling in additive manufacturing: The impact of practical nesting strategies on overall makespan efficiency. IET Collaborative Intelligent Manufacturing, 7: e70036
Wang, D., Fan, Z., Liu, Y., & Moon, I. (2026). A trailer-detention-constrained multi-trailer drop-and-pull container drayage problem with flexible service starting time and time windows. Omega, 138, 103422.
Woo, Y.-B., & Moon, I. (2026). A bilevel approach to reduce peak load of community microgrid with distributed generators. International Transactions in Operational Research, 33, 1157-1185.
Yilmaz, O., Aydin, N., & Kucukkoc, I. (2026). Bi-objective optimization of human-robot collaborative mixed-model assembly lines considering model assignment and energy consumption. Journal of Computational and Applied Mathematics, 473, 116876.
Yuraszeck, F., Mejía, G., Rossit, D. A., & Lüer-Villagra, A. (2025). A constraint programming-based lower bounding procedure for the job-shop scheduling problem. Computers & Operations Research, 177, 106964.

Looking to Publish your Research?

Find out how to publish your research open access with Taylor & Francis Group.

Understand more about Open Access on our Author Services website