Parallel machine scheduling with flexible and deteriorating maintenance activities for minimizing the total completion time
碩士 === 國立中央大學 === 工業管理研究所 === 104 === In this paper we consider the problem of scheduling of n nonresumable jobs on m identical parallel machines with deteriorating and flexible maintenance activities, and the objective is to minimize total completion time. In this paper scheduling, each machine i...
Main Authors: | Kai-Hung Wang, 王凱弘 |
---|---|
Other Authors: | Gwo-Ji Sheen |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01824073717591743885 |
Similar Items
-
Parallel machine scheduling with flexible maintenance activities for minimizing total completion time
by: Wen-Chih Hsu, et al.
Published: (2013) -
Parallel Machine Scheduling with Flexible Maintenance and Resumable Jobs for Minimizing Total Completion Time
by: Shang-Cheng Tsai, et al.
Published: (2017) -
Parallel Machine Scheduling with Flexible Maintenance Activity Periods for Minimizing Total Completion Time
by: Yen-han Li, et al.
Published: (2014) -
Single Machine Scheduling with Flexible Maintenance Periods for Minimizing Total Completion Time
by: Min-Lun Lee, et al.
Published: (2013) -
Single-machine scheduling with both deterioration and learning effects to Minimize Total Weighted Completion Time
by: Yu-Chun Wang, et al.
Published: (2010)