Scheduling of maximizing the weighted number of just-in-time jobs using simulated annealing heuristic
碩士 === 中原大學 === 工業與系統工程研究所 === 98 === We consider the unrelated parallel machines with sequence-dependent setup times problem. The objective is using Simulated Annealing to maximize the weighted number of jobs that are completed exactly at their due date. Each job has different arrival time and can...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/83307962668329408304 |