Minimizing the maximum tardiness in a two-machine flowshop problem with learning considerations
碩士 === 逢甲大學 === 統計與精算所 === 92 === This paper studies a two-machine flowshop scheduling problem with a learning effect where its objective is to find a sequence to minimize the maximum tardiness. We apply a branch-and-bound method and a simulated annealing (SA) method to search for an optimal solutio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29379445813137758151 |