An Iterated Greedy Heuristic Approach for Wafer Probing Scheduling Problems
碩士 === 華梵大學 === 工業工程與經營資訊學系碩士班 === 97 === This study applied an iterated greedy (IG) heuristic to solve the wafer probing scheduling problem (WPSP). WPSP is a variation of the parallel machine scheduling problem (PMSP) with sequence dependent setup times (SDSTs) and due date restriction. The objecti...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/54437118943952621987 |