Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times
Job shop scheduling problem is widely known as one of the most difficult NP-Hard problems to solve and present efforts to solve the problems are mostly expressed in the form of heuristics. This thesis investigates the application of simulated annealing algorithm for solving job shop scheduling probl...
Saved in:
Main Author: | Ahmad, Rashidah |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/38873/5/RashidahAhmadPFS2013.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving job shop scheduling problem using the method of simulated annealing
by: Ramdzan, Nur Amira
Published: (2012) -
Tabu search method for solving multiobjective job shop scheduling problem
by: Awang, Nor Fauzana
Published: (2015) -
Aircraft sequencing problem solve by using simulated annealing method
by: Mohd. Shukor, Muhammad Fahmi
Published: (2017) -
Incorporating genetic algorithm into simulated annealing based redistricting
by: Sim, Kwan Hua.
Published: (2002) -
Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
by: Wakat, Spencer Embong
Published: (2019)