Results 131 to 140 of about 13,809 (278)
IEEE AccessBecause of the wide variety of heterogeneous jobs and the internet’s inherent complexity in relation to runtime capabilities, task scheduling in cloud computing poses a paradigm issue. Some tasks are very computationally intensive and sensitive to
Prashanth Choppara +1 more
doaj +1 more source
Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines [PDF]
, 2017 Ebrahim Asadi-Gangraj
openalex +1 more source
COMPARISON OF METAHEURISTIC METHODS TO MINIMIZE MAKESPAN OF CELL SCHEDULING PROBLEMS [PDF]
, 2009 M. Saravanan, Nooru Haq A
openalex +1 more source
Jurnal Teknik Industri, 2004 This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP) method in solving flowshop scheduling problem to reach minimum makespan.
Tessa Vanina Soetanto +2 more
doaj
Online Parallel Paging with Optimal Makespan
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022 Agrawal K. +5 more
openaire +2 more sources
Heuristic procedures for minimizing makespan and the number of required pallets [PDF]
, 1993 A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort.
Chu, Chengbin +2 more
core
Makespan Optimization Algorithm for Scheduling in Grids
, 2008 M.E. (Software Engineering)Grid Computing is a service aggregation of information and computational resources. To manage these resources efficiently a grid resource management system is required.
Kaur, Gurpreet
core