Research on the Hybrid Simulated annealing Algorithm for Re-entrant Flow Shop Problems
碩士 === 國立臺灣科技大學 === 工業管理系 === 91 === Abstracts In the field of scheduling applications, it faces new challenges happened in the industries everyday. Traditional processing techniques are not able to handle the requirement in the emergence of semiconductor industries and flexible manufactu...
Main Author: | 盧研伯 |
---|---|
Other Authors: | 潘昭賢 |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87824288521934069604 |
Similar Items
-
Research on the Hybrid Genetic Algorithm in Re-entrant Flow Shop and Re-entrant Permutation Flow Shop Problems
by: Chan-Min Lin, et al.
Published: (2003) -
Research on the Hybrid Tabu Search in Re-entrant Flow Shop and Re-entrant Permutation Flow Shop Problems
by: Chien-Kuang Wu, et al.
Published: (2003) -
A Simulated Annealing Method For Re-entrant Job-shop Problem
by: 林義雄
Published: (2001) -
Research on the Hybrid Genetic Algorithm in Re-entrant Job Shop Problem
by: Ho Chien-ho, et al.
Published: (2001) -
Makespan Minimization in Re-entrant Permutation Flow Shops
by: Hinze, Richard
Published: (2018)