Single Machine Scheduling Problem to Minimize Total Absolute Deviation by Simulated Annealing
碩士 === 元智大學 === 工業工程與管理學系 === 85
Main Author: | 吳家增 |
---|---|
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/48587746752840922105 |
Similar Items
-
Single Machine Scheduling Problem Subject to Minimization of Total Absolute Deviation and Setup Cost by Genetic Algorithm
by: Chao Wei-Liang, et al.
Published: (2001) -
Minimizing the total absolute deviation of completion time on a single machine with dust accumulation consideration
by: CUN-ZHI ZHANG, et al.
Published: (2015) -
Robust Single Machine Scheduling to Minimize Total Absolute Difference in Completion Time
by: Peng-Hsien Chiu, et al.
Published: (2010) -
Minimizing makespan subject to minimize total absolute deviation of completion time in an identical parallel machine system
by: Feng-Sheng Che, et al.
Published: (2010) -
Minimizing Total Tardiness for Job Shop Scheduling Using Simulated Annealing
by: WU, KUEI-BIN, et al.
Published: (1998)