Results 111 to 120 of about 23,190 (193)

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

, 2002
We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region.
Arkin, Esther M., Bender, Michael, Fekete, Sandor P., Hsiang, Tien-Ruey, Mitchell, Joseph S. B.   +4 more
core   +1 more source

Dynamic Job Shop Scheduling Problem With New Job Arrivals Using Hybrid Genetic Algorithm

IEEE Access
The present paper tackles the dynamic job shop scheduling problem (DJSSP), aiming to schedule a new set of jobs while minimizing the completion time of all operations. The problem is an NP-hard combinatorial optimization problem.
Kaouther Ben Ali, Slim Bechikh, Ali Louati, Hassen Louati, Elham Kariri   +4 more
doaj   +1 more source

Mixed-criticality scheduling to minimize makespan

, 2016
In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical.
Baruah, Sanjoy, Easwaran, Arvind, Guo, Zhishan   +2 more
openaire   +3 more sources

Improved online load balancing with known makespan

43 pages, 4 ...
Böhm, Martin, Lieskovský, Matej, Schmitt, Sören, Sgall, Jiří, van Stee, Rob   +4 more
openaire   +4 more sources

PENERAPAN EVOLUTIONARY ALGORITHM PADA PENJADWALAN PRODUKSI (Studi Kasus di PT Brother Silver Product Indonesia)

Jurnal Teknik Industri, 2001
This research gives an alternative to build production schedule using Evolutionary Algorithm. The objective function is minimizing production makespan. Shortest Processing Time (SPT) and Longest Processing Time (LPT) methods are used as initial solution.
Lala Febriana, I Gede Agus Widyadana
doaj  

Efficient Hybrid DDPG Task Scheduler for HPC and HTC in Cloud Environment

IEEE Access
Task Scheduling is a crucial challenge in cloud computing as diversified tasks come rapidly onto cloud console dynamically from heterogeneous resources which consists of different task lengths, processing capacities.
S. Sudheer Mangalampalli, Ganesh Reddy Karri, Sachi Nandan Mohanty, Shahid Ali, Atif M. Alamri, Salman A. Alqahtani   +5 more
doaj   +1 more source

TABU SEARCH SEBAGAI LOCAL SEARCH PADA ALGORITMA ANT COLONY UNTUK PENJADWALAN FLOWSHOP

Jurnal Teknik Industri, 2009
Ant colony optimization (ACO) is one of the meta-heuristic methods developed for finding solutions to optimization problems such as scheduling. Local search method is one part of the ACO which determines the quality of the resulting solution.
Iwan Halim Sahputra, Tanti Octavia, Agus Susanto Chandra   +2 more
doaj  

PENJADWALAN FLOW SHOP N JOB M MESIN DENGAN METODE FIRST COME FIRST SERVED (FCFS), EARLIEST DUE DATE (EDD) DAN ALGORITMA HEURISTIK POUR

Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2018
Penelitian ini membahas tentang penjadwalan flow shop n job m mesin dengan pendekatan metode First Come First Served (FCFS), Earliest Due Date (EDD) dan Algoritma Heuristik Pour.
Dwi Agustina Kurniawati, Abdul Latief Irsyad   +1 more
doaj  

An Effective CDS Heuristic for the Fuzzy Flow Shop Scheduling Problem With Ordered Precedence Constraints Using Pentagonal Fuzzy Processing Time

IEEE Access
In today’s modern manufacturing environment, effective production scheduling has a major impact on constructing schedules that meet customer demands efficiently, with uncertainties in production processes, such as variable job processing times and
K. Ranjith, K. Karthikeyan
doaj   +1 more source

Reliability and Trust Aware Task Scheduler for Cloud-Fog Computing Using Advantage Actor Critic (A2C) Algorithm

IEEE Access
Because 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, S. Sudheer Mangalampalli   +1 more
doaj   +1 more source