A New Lower Bound Scheme for Production Scheduling in Flowshops
碩士 === 國立暨南國際大學 === 資訊管理學系 === 91 === The purpose of this study is to present a simple and effective lower bound for the minimization of total completion time in a two-machine flowshop and extend the lower bound for the general bicriteria problem in a two-machine flowshop. The two problems are known...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65710971682668886066 |