A branch and bound and simulated annealing approach for job shop scheduling
This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop s...
Saved in:
Main Authors: | Tan, Hui Woon, Salim, Sutinah |
---|---|
Format: | Article |
Language: | English |
Published: |
Department of Mathematics, Faculty of Science
2004
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/8799/1/TanHuiWoon2004_ABranchandBoundandSimulated.pdf http://eprints.utm.my/id/eprint/8799/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Modified Giffler and Thompson Genetic Algorithm on the Job
Shop Scheduling Problem
by: Lee, Hui Peng, et al.
Published: (2006) -
Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times
by: Ahmad, Rashidah
Published: (2013) -
A simulated annealing approach for uncapacitated continuous location-allocation problem with zone-dependent fixed cost
by: Abdullah, Tolhah, et al.
Published: (2008) -
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
by: Kelvin, Lim Ching Wei
Published: (2023) -
Solving job shop scheduling problem using the method of simulated annealing
by: Ramdzan, Nur Amira
Published: (2012)