Scheduling Open Shops to Minimize Total Weighted Tardiness
碩士 === 朝陽大學 === 工業工程與管理系碩士班 === 88 === The open shop scheduling problem can be stated as follows. There are n independent jobs and m different machines. Each job consists of m operations, each of which must be processed on one of these machines. There is no restriction on the order in which the oper...
Main Authors: | An-Hsiang Lin, 林安祥 |
---|---|
Other Authors: | Ching-Fang Liaw |
Format: | Others |
Language: | zh-TW |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/14844442733778160515 |
Similar Items
-
Scheduling Preemptive Open Shops to Minimize Weighted and Unweighted Number of Tardy Jobs
by: Hsiao-Ya Kao, et al.
Published: (2008) -
Minimizing Total Weighted Tardiness and Carbon Emission for Permutation Flow Shop Scheduling Problems
by: Shang-Yen Hsieh, et al.
Published: (2014) -
Scheduling Unrelated Parallel-Machine to Minimize Total Weighted Tardiness
by: Yang-Kuei Lin, et al.
Published: (2001) -
Minimizing Total Tardiness in Flow Shop Scheduling Problem with Blocking
by: Pei-shiuan Huang, et al.
Published: (2015) -
Minimizing Total Tardiness for Job Shop Scheduling Using Simulated Annealing
by: WU, KUEI-BIN, et al.
Published: (1998)