A Discrete Backtracking Search Optimization Algorithm for Solving Stochastic Job Shop Scheduling Problem
碩士 === 朝陽科技大學 === 資訊工程系 === 105 === This thesis proposes a discrete backtracking search optimization algorithm (DBSA) to solve the stochastic job shop scheduling problem (SJSSP). The proposed DBSA utilizes the advantage of multi-directional search in backtracking search optimization algorithm (BSA)...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/49yw3u |