Results 71 to 80 of about 4,494 (215)
Online Makespan Scheduling with Sublinear Advice [PDF]
, 2015 Online algorithms are of importance for many practical applications. Typical examples involve scheduling and routing algorithms employed in operating systems and computer networks. Beside their practical signicance, online algorithms are extensively studied from a theoretical point of view. Due to the nature of online problems, these algorithms fail to
openaire +4 more sources
Makespan Minimization in Job Shop Scheduling
International Journal of Engineering and Management Research, 2021 In industries, the completion time of job problems in the manufacturing unit has risen significantly. In several types of current study, the job's completion time, or makespan, is reduced by taking straight paths, which is time-consuming. In this paper, we used an Improved Ant Colony Optimization and Tabu Search (ACOTS) algorithm to solve this problem ...
openaire +4 more sources
Advancing anomaly detection in cloud environments with cutting‐edge generative AI for expert systems
Expert Systems, Volume 42, Issue 2, February 2025.Abstract As artificial intelligence (AI) continues to advance, Generative AI emerges as a transformative force, capable of generating novel content and revolutionizing anomaly detection methodologies. This paper presents CloudGEN, a pioneering approach to anomaly detection in cloud environments by leveraging the potential of Generative Adversarial ...
Umit Demirbaga
wiley +1 more source
A Discrete Sine Optimization Algorithm for No-Idle Flow-Shop Scheduling Problem
Shanghai Jiaotong Daxue xuebao, 2020 Aimed at the no-idle flow-shop scheduling problem (NIFSP) with minimized makespan, a discrete sine optimization algorithm (DSOA) is proposed. Inspired by sine waveforms, the original sine optimization algorithm (SOA) is a global optimization algorithm ...
ZHAO Rui, GU Xingsheng
doaj +1 more source
IET Blockchain, Volume 5, Issue 1, January/December 2025.Grid computing is an emerging technology that enabled the heterogeneous collection of data and provisioning of services to the users. Due to the high amount of incoming heterogeneous request, grid computing needs an efficient scheduling to reduce execution time and satisfy service level agreement (SLA) and quality of service (QoS) requirements.
Gangasandra Mahadevaiah Kiran +1 more
wiley +1 more source
Agent‐based simulation system for optimising resource allocation in production process
IET Collaborative Intelligent Manufacturing, Volume 7, Issue 1, January/December 2025.A multi‐agent‐based simulation system developed to simulate and optimise resource allocation in complex processes with network structures and temporal constraints. The primary objective is to minimise production completion time while ensuring effective resource allocation.
Jingjing Zhao, Fan Zhang
wiley +1 more source
IET Collaborative Intelligent Manufacturing, Volume 7, Issue 1, January/December 2025.This paper proposes a digital twin and big data‐based opti‐state control system (DTBD‐OsCS) to address challenges in production logistics systems caused by dynamic disturbances. By integrating predictive and adaptive opti‐state control strategies, along with big data analytics, the proposed system enables more informed optimisation decisions ...
Yongheng Zhang +4 more
wiley +1 more source
IET Collaborative Intelligent Manufacturing, Volume 7, Issue 1, January/December 2025.Cognitive workload (CWL) assessment is increasingly important in Industry 4.0 and 5.0, with a growing emphasis on multimodal approaches that combine physiological measures (e.g., EEG, eye tracking, heart rate) and subjective evaluations. This review of 69 articles highlights advancements in real‐time monitoring, context‐specific applications and ...
Andrea Lucchese +2 more
wiley +1 more source
A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems
Applied Sciences, 2019 The permutation flow shop scheduling problem (PFSP) is a renowned problem in the scheduling research community. It is an NP-hard combinatorial optimization problem that has useful real-world applications.
Ko-Wei Huang +3 more
doaj +1 more source
Behavior of the main parameters of the Genetic Algorithm for Flow Shop Scheduling Problems
Revista Cubana de Ciencias Informáticas, 2014 There are different suggested values to adapt the basic parameters of a Genetic Algorithm, however, these values may not be the optimal for all kinds of applications.
Yunior César Fonseca Reyna +3 more
doaj