Makespan minimization for two parallel machines
碩士 === 國立臺灣科技大學 === 工業管理系 === 89 === In the paper, we consider a two-parallel-machine problem where one machine is not available during a time period. The unavailable time period is fixed and known in advance. A machine is not available probably because it needs preventive maintenance or periodical...
Main Authors: | Der-Lin Shyur, 徐德霖 |
---|---|
Other Authors: | Ching-Jong Liao |
Format: | Others |
Language: | en_US |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/23263267640316385564 |
Similar Items
-
Makespan Minimization for Two Parallel Machines with Cardinality Constraints
by: Cheng-Ming Chen, et al.
Published: (2004) -
Makespan Minimization on Various Parallel Machine Problems
by: Chien-Hung Lin, et al.
Published: (2003) -
Minimizing makespan on parallel machines with chamber and machine eligibility
by: Shuo-Chien Kao, et al.
Published: (2018) -
Minimizing makespan in two-stage flowshop with batch machine and identical parallel machines
by: CHUNG-KANG LI, et al.
Published: (2008) -
Minimizing flowtime subject to optimal makespan on two identical parallel machines
by: Jatinder N. D. Gupta, et al.
Published: (2000-06-01)