A Branch and Bound Algorithm for Total Tardiness Minimization in a Two-machine Flow Shop with Blocking
碩士 === 國立中央大學 === 工業管理研究所 === 104 === This study deals with the two-machine flowshop scheduling problem with blocking to minimize total tardiness. The blocking flowshop scheduling problem (BFSP) occurs in a variety production processes where no intermediate buffer exists between machines. In pra...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31159529853836766764 |