Results 111 to 120 of about 13,809 (278)
Penjadwalan Batch pada Dua Mesin Homogen untuk Meminimasi Makespan
, 2020 Prosedur batching atau teknik penjadwalan batch merupakan salah satu metoda yang banyak diterapkan dalam memecahkan masalah penjadwalan Penelitian ini akan membahas pemecahan masalah penjadwalan batch pada dua mesin homogen dengan tujuan untuk meminimasi
Rinto Yuriski
core +1 more source
The complexity of generating robust resource-constrained baseline schedules. [PDF]
Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise.
Herroelen, Willy, Leus, Roel
core
The trade-off between stability and makespan in resource-constrained project scheduling. [PDF]
During the last decade a lot of research efforts in the project scheduling literature have concentrated on resource-constrained project scheduling under uncertainty.
Herroelen, Willy +3 more
core +2 more sources
Makespan values in seconds for different task requests.
, 2020 Makespan values in seconds for different task requests.
Mohamed Abouhawwash (8735274) +5 more
core +1 more source
Local search performance guarantees for restricted related parallel machine scheduling
We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In
Recalde Diego +3 more
core
PENGEMBANGAN PERANGKAT LUNAK PADA PENJADWALAN JOB SHOP UNTUK MEMINIMASI MAKESPAN [PDF]
, 2012 PT.Yogya Presisi Teknikatama Industri (PT.YPTI) adalah sebuah perusahaan yang bergerak dalam bidang industri manufaktur dengan produk yang dihasilkan berupa mold dan sparepart.
DE SOUSA SOARES, GRAZINDA
core
Dynamic Job Shop Scheduling Problem With New Job Arrivals Using Hybrid Genetic Algorithm
IEEE AccessThe 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 +4 more
doaj +1 more source
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 +2 more sources
Mean makespan task scheduling approach for the edge computing environment
Task scheduling in the edge computing environment poses significant challenges due to its inherent NP-hard nature. Several researchers concentrated on minimizing simple makespan, disregarding the reduction of the mean time to complete all tasks ...
Kumar, Jitender, Saini, Nisha
core +1 more source