Special Issues
Table of Content

Algorithms for Planning and Scheduling Problems

Submission Deadline: 17 August 2025 (closed) View: 1612 Submit to Journal

Guest Editors

Prof. Dr. Frank Werner, Otto-Von-Guericke-University, Germany
Dr. Mohammad Shokouhifar, Shahid Beheshti University, Iran


Summary

In the ever-evolving landscape of industrial and service operations, the ability to efficiently plan and schedule resources is critical for simultaneously achieving an optimal performance and competitiveness. Planning and scheduling problems are common in many industries such as production planning, supply chain management, logistics, healthcare and medical services, project planning, and smart cities. These problems are inherently complex, often involving multiple objectives with numerous constraints that need to be optimized. Therefore, developing robust algorithms is essential to effectively address these challenges and enable the efficient organization of resources, leading to optimal or near-optimal solutions.


This special issue aims to address the increasing complexity of planning and scheduling problems by exploring a wide range of algorithmic techniques and methodologies. Beyond exact and mathematical techniques, we also encourage contributions focusing on heuristics, hyperheuristics, and metaheuristics, fuzzy systems, and machine learning techniques that offer flexible and effective solutions. Furthermore, we are interested in the intelligent design of hybrid approaches that combine various algorithmic strategies to exploit their complementary strengths. Topics of interest include, but are not limited to:

Integer and mixed-integer programming

Nonlinear programming for complex system optimization

Stochastic programming for uncertain environments

Exact search techniques: branch and bound methods, dynamic programming, …

Heuristic, metaheuristic, and hyper-heuristic algorithms

Fuzzy sets and systems for uncertainty handling

Machine learning and reinforcement techniques

Hybrid heuristic-metaheuristic techniques

Hybrid metaheuristic-machine learning techniques

Hybrid learning-based hyperheuristic design algorithms

Just-in-time algorithms for dynamic scheduling

Applications in job-shop scheduling problems

Applications in resource allocation problems

Applications in project planning and scheduling

Applications in manufacturing and production planning

Applications in healthcare and medical services

Applications in IoT and smart cities


Keywords

Scheduling problems, Planning and control systems, Mathematical programming, Heuristics, metaheuristics, Fuzzy systems, Machine learning, Hybrid optimization algorithms

Published Papers


  • Open Access

    ARTICLE

    A Q-Learning Improved Particle Swarm Optimization for Aircraft Pulsating Assembly Line Scheduling Problem Considering Skilled Operator Allocation

    Xiaoyu Wen, Haohao Liu, Xinyu Zhang, Haoqi Wang, Yuyan Zhang, Guoyong Ye, Hongwen Xing, Siren Liu, Hao Li
    CMC-Computers, Materials & Continua, Vol.86, No.1, pp. 1-27, 2026, DOI:10.32604/cmc.2025.069492
    (This article belongs to the Special Issue: Algorithms for Planning and Scheduling Problems)
    Abstract Aircraft assembly is characterized by stringent precedence constraints, limited resource availability, spatial restrictions, and a high degree of manual intervention. These factors lead to considerable variability in operator workloads and significantly increase the complexity of scheduling. To address this challenge, this study investigates the Aircraft Pulsating Assembly Line Scheduling Problem (APALSP) under skilled operator allocation, with the objective of minimizing assembly completion time. A mathematical model considering skilled operator allocation is developed, and a Q-Learning improved Particle Swarm Optimization algorithm (QLPSO) is proposed. In the algorithm design, a reverse scheduling strategy is adopted to effectively… More >

  • Open Access

    ARTICLE

    Real-Time Dynamic Multiobjective Path Planning: A Case Study

    Hongle Li, SeongKi Kim
    CMC-Computers, Materials & Continua, Vol.85, No.3, pp. 5571-5594, 2025, DOI:10.32604/cmc.2025.067424
    (This article belongs to the Special Issue: Algorithms for Planning and Scheduling Problems)
    Abstract Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles, as well as the realism and immersion of virtual environments. However, traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments. This study addresses these limitations through a proposed real-time dynamic multiobjective (RDMO) path-planning algorithm based on an enhanced A* framework. The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real… More >

  • Open Access

    ARTICLE

    An Adaptive Hybrid Metaheuristic for Solving the Vehicle Routing Problem with Time Windows under Uncertainty

    Manuel J. C. S. Reis
    CMC-Computers, Materials & Continua, Vol.85, No.2, pp. 3023-3039, 2025, DOI:10.32604/cmc.2025.066390
    (This article belongs to the Special Issue: Algorithms for Planning and Scheduling Problems)
    Abstract The Vehicle Routing Problem with Time Windows (VRPTW) presents a significant challenge in combinatorial optimization, especially under real-world uncertainties such as variable travel times, service durations, and dynamic customer demands. These uncertainties make traditional deterministic models inadequate, often leading to suboptimal or infeasible solutions. To address these challenges, this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms (GA) with Local Search (LS), while incorporating stochastic uncertainty modeling through probabilistic travel times. The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance. This adaptivity enhances the algorithm’s… More >

  • Open Access

    ARTICLE

    An Adaptive Cooperated Shuffled Frog-Leaping Algorithm for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Processes

    Lianqiang Wu, Deming Lei, Yutong Cai
    CMC-Computers, Materials & Continua, Vol.83, No.2, pp. 1771-1789, 2025, DOI:10.32604/cmc.2025.063944
    (This article belongs to the Special Issue: Algorithms for Planning and Scheduling Problems)
    Abstract Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines (BPM). In this study, the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered, and an adaptive cooperated shuffled frog-leaping algorithm (ACSFLA) is proposed to minimize makespan and total tardiness simultaneously. ACSFLA determines the search times for each memeplex based on its quality, with more searches in high-quality memeplexes. An adaptive cooperated and diversified search mechanism is applied, dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality. During the… More >

Share Link