Staff Scheduling for Multiple Convenience Stores by Genetic Algorithm in Python
碩士 === 國立臺灣科技大學 === 企業管理系 === 107 === This study intends to simulate solving the staff scheduling problem for multiple convenience stores by genetic algorithm in Python. This denotes in an acceptable time obtaining a schedule that eliminates redundant payroll costs, while meeting operational require...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/xw9nk6 |