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...

Full description

Saved in:
Bibliographic Details
Main Author: Farashahi, Hamid Ghaani
Format: Thesis
Published: 2010
Online Access:http://psasir.upm.edu.my/id/eprint/41178/1/FK%202010%2083%20IR.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!