Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
The two-machine flow shop problem was shown to be NP-hard when the objective is to minimize total (mean) completion time instead of makespan even for the case where setup times are neglected. This means that it is highly unlikely to find a polynomial algorithm to solve the problem. Therefore, resear...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2005-12.
|
| Subjects: | |
| Online Access: | Get fulltext |