•Science Program (Mathematics)
Science Program - Industrial Applications in Operational Research, Optimization, Statistics
The research that I have done before is about solving the job shop scheduling by using heuristics such as simulated annealing. The job shop problem is considered important because it reflects the actual operation of several industries. In a job shop on any given day, several jobs may require scheduling, each with a different processing sequence and different processing times on the machines. This problem is known to be NP-hard and also a notoriously difficult problem in computational optimization. In job shop processing, the order of different jobs may be different but it fixed, and jobs are independent of each other. The objective of this research is to minimize the makespan which is the maximum completion time. For solving the job shop scheduling, we use simulated annealing with different types of cooling schedule. The simulated annealing has been by far the most popular and easiest algorithm and has been applied successfully to the job-shop problems. Form the study, the results show the cooling schedule that reduces the temperature gradually is better than reduce it rapidly and one of the successes of simulated annealing is determined by choices of the cooling schedule.