Results 101 to 110 of about 25,495 (197)

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 efficient hybrid approach based on multi agent system and emergence method for the integration of systematic preventive maintenance policies in hybrid flow-shop scheduling to minimize makespan [PDF]

, 2013
Adel Abdelhadi
openalex   +1 more source

Testing the Performance of Bat-Algorithm for Permutation Flow Shop Scheduling Problems with Makespan Minimization [PDF]

, 2022
R. Robert, Brabin Nivas Murugadhas Leela, Senthil Maharaj Kennedy   +2 more
openalex   +1 more source

STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP

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, Herry Christian Palit, Ika Munika   +2 more
doaj  

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

Minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers

, 2006
Bret Crowder
openalex   +2 more sources

How the structure of precedence constraints may change the complexity class of scheduling problems

, 2017
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they become ...
Bellenguez-Morineau, Odile, Prot, Damien
core   +1 more source

Minimizing makespan in a three-stage hybrid flow shop with dedicated machines

, 2018
Asma Ouled Bedhief, Najoua Dridi
openalex   +1 more source

Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems

, 2007
Jack Dongarra, Emmanuel Jeannot, Érik Saule, Zhiao Shi   +3 more
openalex   +2 more sources