Shortest processing time rule and longest processing time in minimizing makespan for job shop scheduling problem /

Shortest processing time rule and longest processing time in minimizing makespan for job shop scheduling problem /

Project Paper (Sarjana Muda Sains (Matematik Industri)) - Universiti Teknologi Malaysia, 2006

Détails bibliographiques
Auteur principal: 299951 Yim, Sai Hoo
Format:
Langue:eng
Publié: Skudai : Universiti Teknologi Malaysia, 2006
Sujets:
Industrial engineering
Genetic algorithms
Mathematical optimization
Description
Résumé:Project Paper (Sarjana Muda Sains (Matematik Industri)) - Universiti Teknologi Malaysia, 2006

Documents similaires