An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. Th...

This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on ...

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carli...

A batch processing machine can simultaneously process several jobs forming a batch. This paper considers the problem of scheduling jobs with non-identical capacity requirements, on a single-batch processing machine of a given capacity, to minimize the makespan. The processing time of a batch is equal to the largest processing time of any job in the batch. We present some dominance properties fo...

This study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time...

Penelitian ini bertujuan untuk mengetahui waktu proses minimum yang dibutuhkan dalam penyelesaian suatu produk serta metode penjadwalan produksi lebih efisien antara usulan dengan diterapkan di rumah Industri Wahyu, karena kondisi saat berdasarkan First Come Serve (FCFS) menyebabkan adanya keterlambatan produk. Untuk itu, dilakukan penelitian pendekatan deskriptif-kuantitatif menggunakan CDS (C...