Scheduling Problems to Minimize Makespan and Total Completion Time in Flowshop Environment with Learning Effects
博士 === 國立交通大學 === 工業工程與管理學系 === 100 === In traditional scheduling problems, the processing time for a given job is assumed to be a fixed constant no matter the scheduling order of the job. However, it is noticeable that the job processing time declines as workers gain more experience. This phenomeno...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23920650868849125159 |