PES Business Review

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


This paper discusses a set of heuristic algorithms used to maximize the percentage utilization of machines in a Job shop scheduling (JSS) problem. Job shop scheduling environment consists of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with specified processing order. In this paper, Genetic Algorithm (GA), Simulated Annealing (SA) and Hybrid Simulated Annealing (HSA) algorithms are used for the objective measure of utilization of machines in Job Shop Model problem. These three algorithms are considered as different treatments of each problem and are compared. The conclusion is that percentage utilization of machine is maximum in most of the cases under Genetic Algorithm when compared with other two algorithms.

Keywords

Job Shop Scheduling, Genetic Algorithm, Simulated Annealing, Hybrid Simulated Annealing and Percentage Utilization of Machines.
User
Notifications
Font Size