Results 121 to 130 of about 13,809 (278)

Makespan Minimizing on Multiple Travel Salesman Problem With a Learning Effect of Visiting Time

, 2020
Chiara Colombaroni, Mostafa Mohammadi, Golman Rahmanifar   +2 more
openalex   +1 more source

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  

Minimizing Makespan in a Pallet-Constrained Flowshop

, 2000
We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a owshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of
Chelliah Sriskandarajah, M. Y. Wang, Han Hoogeveen, Steef Van De Velde, Suresh P. Sethi   +4 more
core  

PENGARUH UKURAN LOT TERHADAP MAKESPAN MINIMUM DALAM PENJADWALAN PRODUK MULTILEVEL [PDF]

, 2008
Waktu produksi (makespan) sebanding dengan biaya produksi. Semakin panjang makespan, semakin besar pula biaya yang dibutuhkan. Untuk itulah perlu dilakukan penjadwalan untuk meminimasi makespan.
Pravita Sari, Monikha
core  

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

Envy-Free Makespan Approximation

We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor ...
Amos Fiat, Haim Kaplan, Edith Cohen, Michal Feldman, Svetlana Olonetsky   +4 more
core  

Permutation flowshop scheduling with periodic maintenance and makespan objective

, 2020
Paz Pérez-González, Victor Fernández-Viagas, José M. Framiñán   +2 more
openalex   +2 more sources