Uniform Parallel-Machine Scheduling Problems with Constrained Resources
碩士 === 元智大學 === 工業工程與管理學系 === 96 === The previous studies on uniform parallel-machine scheduling problems usually assume that the necessary resources for processes are unconstrained. However, it does not conform to condition that the resources in scheduling problems are usually limited in practice....
Main Authors: | Yi-Chen Wang, 王苡宸 |
---|---|
Other Authors: | 蔡啟揚 |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43489619664097771494 |
Similar Items
-
Enhanced Mixed Integer Programming Formulations for Parallel Machines Scheduling with Machine Idle Time
by: Yi-Chen Wang, et al. -
An Approach of Unrelated Parallel-Machine Flow Shop Scheduling Problems with Constrained Resources
by: Chien-ming Chen, et al.
Published: (2009) -
A Branch and Bound for Unrelated Parallel-Machine Scheduling Problems with Constrained Resources
by: Yu-Hua Lai, et al.
Published: (2007) -
A Simulated Annealing Algorithm for Unrelated Parallel-Machine Scheduling Problem with Constrained resources
by: Si-Nong Wu, et al.
Published: (2005) -
A Genetic Algorithm Approach for Unrelated Parallel-Machine Scheduling Problems with Constrained Resources
by: Chih-Jye Tseng, et al.
Published: (2006)