Results 61 to 70 of about 13,809 (278)
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
Makespan - Uniform Distributed Dataset.
, 2016 Makespan - Uniform Distributed Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source
International Transactions in Operational Research, Volume 33, Issue 2, Page 860-891, March 2026.Abstract Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption.
Ernesto G. Birgin +2 more
wiley +1 more source
A makespan minimization problem for versatile developers in the game industry [PDF]
, 2022 Chung-Ho Su, Jen-Ya Wang
openalex +1 more source
Makespan analysis for EHJSO method with existing system.
, 2023 Makespan analysis for EHJSO method with existing system.
D. Paulraj (14784530) +4 more
core +2 more sources
Local Optima Networks for the Permutation Flowshop Scheduling Problem: Makespan vs. Total Flow Time [PDF]
, 2017 Local Optima Networks were proposed to understand the structure of combinatorial landscapes at a coarse-grained level. We consider a compressed variant of such networks with features that are meaningful for the study of search difficulty in the context ...
Daolio, Fabio +8 more
core +1 more source
Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz +1 more
wiley +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
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