Flexible job shop scheduling using priority heuristics and genetic algorithm
In this research, flexible job shop scheduling problem has been studied. The aim of this research is to minimize the maximum completion time (makespan). The job shop scheduling is very common in practice and uniform machines (parallel machines with different speeds) have been used in job shop enviro...
Saved in:
Main Author: | Farashahi, Hamid Ghaani |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Online Access: | http://psasir.upm.edu.my/id/eprint/41178/1/FK%202010%2083%20IR.pdf http://psasir.upm.edu.my/id/eprint/41178/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Job shop scheduling using shifting bottleneck heuristic algorithm
by: Tamtomo, B. T., et al.
Published: (2021) -
Agent Based Priority Heuristic for Job Scheduling on Computational Grids
by: Ahmad Kamil bin Mahmood ,
Published: (2012) -
A genetic algorithm approach for solving a flexible job shop scheduling problem
by: Vaghefinezhad, Sayedmohammadreza, et al.
Published: (2012) -
Optimization of job scheduling in a machine shop using genetic algorithm
by: Adhikari, A., et al.
Published: (2002) -
Optimization of job scheduling in a machine shop using genetic algorithm
by: Adhikari, A., et al.
Published: (2002)