Results 91 to 100 of about 23,190 (193)

Optimizing the Number of Cells and Makespan in Cellular Manufacturing System

Journal of Engineering, Volume 2026, Issue 1, 2026.
In the competitive shoe manufacturing industry, efficient production scheduling often struggles to balance minimizing makespan (MS) and reducing the number of cells, leading to increased complexity. This study introduces a biobjective optimization model to minimize the MS and the number of cells in a cellular manufacturing (CM) system.
Ibrahim Mousad, Moustafa Gadalla, Wael Salaheddin Moughith, Abbas Atef Hassan, Himadri Majumder   +4 more
wiley   +1 more source

A New Hybrid Social Spider Optimization and Tabu Search for the Permutation Flow Shop Scheduling Problem

Journal of Electrical and Computer Engineering, Volume 2026, Issue 1, 2026.
The permutation flow shop scheduling problem (PFSP) is an NP‐complete problem that represents a significant challenge in manufacturing and production environments. Memetic algorithms (MAs) that hybridize global search strategies with local refinement techniques are widely regarded as among the most powerful metaheuristic approaches for addressing ...
Mohamed Kurdi, Toufik Mzili, Ahmad Steef, Momina Shaheen, Ayman Al-Quraan   +4 more
wiley   +1 more source

Efficient Task Scheduling and Load Balancing in Fog Computing for Crucial Healthcare Through Deep Reinforcement Learning

IEEE Access
In healthcare, real-time decision making is crucial for ensuring timely and accurate patient care. However, traditional computing infrastructures, with their wide ranging capabilities, suffer from inherent latency, which compromises the efficiency of ...
Prashanth Choppara, Bommareddy Lokesh
doaj   +1 more source

PENDEKATAN ALGORITMA CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PENJADWALAN FLOW SHOP

Journal of Engineering and Management in Industrial System, 2014
In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan  for stick skewers rounding machine.
Dian Setiya Widodo, Purnomo Budi Santoso, Eko Siswanto   +2 more
doaj   +1 more source

Minimum‐Peak‐Cost Flows Over Time

Networks, Volume 86, Issue 4, Page 389-401, December 2025.
ABSTRACT Peak cost is a novel objective for flows over time that describes the amount of workforce necessary to run a system. We focus on minimizing peak costs in the context of maximum temporally repeated flows and formulate the corresponding MPC‐MTRF problem.
Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, Sabrina Schmitz, Sophia Wrede   +7 more
wiley   +1 more source

Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale

Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque, Ezhilmathi Krishnasamy, Tiago Carneiro, Nouredine Melab, Pascal Bouvry   +4 more
wiley   +1 more source

Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

Applied Sciences, 2020
Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang, Haoran Xue, Ming-Lang Tseng, Ming K. Lim, Kaihua Liu   +4 more
doaj   +1 more source

Special cases of online parallel job scheduling [PDF]

, 2007
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled ...
Hurink, Johann L., Paulus, Jacob Jan
core   +3 more sources

Proportionally Fair Makespan Approximation

Proceedings of the AAAI Conference on Artificial Intelligence
We study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the egalitarian social cost in the fair division of chores. The two prevalent fairness notions in the fair division literature are envy-freeness and proportionality. Prior work has
Feldman, Michal, Garg, Jugal, Narayan, Vishnu V., Ponitka, Tomasz   +3 more
openaire   +2 more sources

A Comprehensive Survey on LLM‐Based Network Management and Operations

International Journal of Network Management, Volume 35, Issue 6, November/December 2025.
ABSTRACT The growing demands for network capacity and the increasing complexities of modern network environments pose significant challenges for effective network management and operations. In response, network operators and administrators are moving beyond traditional manual and rule‐based methods, adopting advanced artificial intelligence (AI)‐driven
Jibum Hong, Nguyen Van Tu, James Won‐Ki Hong   +2 more
wiley   +1 more source