Order scheduling on fully flexible machines to minimize number of late orders
碩士 === 國立交通大學 === 工業工程與管理系所 === 102 === We consider the order scheduling problem on fully flexible machine environment. Our objective is to minimize number of late orders. We show that our problem, PFm | πk | ∑Uj , is NP-complete. We also show two properties for formulating the mathematical mode...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63893903459526936543 |