Minimizing Total Flowtime with Arrival Time in Batches on Identical Parallel Machines
碩士 === 中原大學 === 工業工程研究所 === 95 === This paper considers the identical parallel machines problem, where jobs arrive in batches. The objective is to minimize the total completion time. Since the single machine problem with job arrival time is known to be NP-hard, therefore the problem is NP-hard in th...
Main Authors: | Tsui-Ping Chung, 鍾翠萍 |
---|---|
Other Authors: | Ling-Huey Su |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02292190095830243568 |
Similar Items
-
Minimizing flowtime subject to optimal makespan on two identical parallel machines
by: Jatinder N. D. Gupta, et al.
Published: (2000-06-01) -
Bicriterion total flowtime and maximum tardiness minimization order scheduling problem
by: LIN,TZU-YUN, et al.
Published: (2017) -
Fuzzy Programming for Parallel Machines Scheduling:
Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
by: Mohammad Asghari, et al.
Published: (2016-09-01) -
Heuristics for Single- and Multi-stage Identical Parallel Machine Scheduling Problems
by: Tsui-Ping Chung, et al.
Published: (2011) -
Minimizing Total Tardiness and Carbon Emission for Identical Parallel Machines with Batch Processing Machines
by: Tsu-Yuan Cheng, et al.
Published: (2014)