Results 61 to 70 of about 22,962 (193)
Genetic Algorithm Based Multipath Optimization for Multimobile Robot Navigations
Engineering Reports, Volume 8, Issue 2, February 2026.Multimobile Robot Flow Network Problem (MMRNP) is to find optimum navigation paths in a network without robot collisions. In this paper, we present a heuristic approach using Genetic Algorithm (GA) to achieve the near‐optimal solution. We propose a new population initialization for our GA with different operators.
K. Somasundaram, Juha Plosila
wiley +1 more source
Mendel, 2019 The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time
Abdelhamid Khiat, Abdelkamel Tari
doaj +1 more source
A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem
Mathematics, 2021 In this research, a new approach for tackling the permutation flow shop scheduling problem (PFSSP) is proposed. This algorithm is based on the steps of the elitism continuous genetic algorithm improved by two strategies and used the largest rank value ...
Mohamed Abdel-Basset +4 more
doaj +1 more source
IET Collaborative Intelligent Manufacturing, Volume 8, Issue 1, January/December 2026.This study addresses an integrated job shop scheduling problem with material handling robots, aiming to minimise the maximum completion time. Three meta‐heuristics, seven local search strategies and two reinforcement learning algorithms are proposed to solve the problems.
Qi Jia +3 more
wiley +1 more source
Efficient Algorithms for Scheduling Moldable Tasks
, 2021 We study the problem of scheduling $n$ independent moldable tasks on $m$ processors that arises in large-scale parallel computations. When tasks are monotonic, the best known result is a $(\frac{3}{2}+\epsilon)$-approximation algorithm for makespan ...
Loiseau, Patrick, Wu, Xiaohu
core
Mathematics, 2022 In this paper, we address the permutation flow shop scheduling problem with sequence-dependent and non-anticipatory setup times. These setups are performed or supervised by multiple servers, which are renewable secondary resources (typically human ...
Victor Fernandez-Viagas +4 more
doaj +1 more source
Minimizing makespan in hybrid flowshops
Operations Research Letters, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA ( host institution ) +2 more
openaire +3 more sources
Time‐ and Behaviour‐Preserving Execution of Determinate Supervisory Control
IET Cyber-Physical Systems: Theory &Applications, Volume 11, Issue 1, January/December 2026.The activity framework is a model‐based framework incorporating a model of activities with determinate timing and behaviour, and a strong mathematical foundation based on max‐plus algebra that allows efficient timing analysis and optimisation of CPS. Preserving the specified behaviour and the model‐predicted timing in an implementation is challenging ...
Alireza Mohamadkhani +3 more
wiley +1 more source
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]
, 2018 This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor +2 more
core
Journal of Engineering and Management in Industrial System, 2015 In this study done on leather shoe company that uses flow shop scheduling strategies. Where the purpose of this study is to minimize makespan is the total time needed to complete the entire job.
Hasan Bashori +2 more
doaj +1 more source