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 http://eprints.utm.my/id/eprint/38873/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A branch and bound and simulated annealing approach for job shop scheduling
by: Tan, Hui Woon, et al.
Published: (2004) -
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) -
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
by: M., Muziana, et al.
Published: (2015) -
A Modified Giffler and Thompson Genetic Algorithm on the Job
Shop Scheduling Problem
by: Lee, Hui Peng, et al.
Published: (2006)