A hybrid lower bound for multi-processor task scheduling problems in multi-stage hybrid flow shop environment
In this paper, a lower bound for the optimal makespan value have been improved (Hybrid lower bound) which can be used to evaluate the performance algorithm for multi-processor task scheduling problems in multi-stage FSMP(flow shop with multi-processor). So, the values of hybrid lower bounds can be...
| Format: | Article |
|---|---|
| Language: | Arabic |
| Published: |
College of Computer Science and Mathematics, University of Mosul
2010-06-01
|
| Series: | المجلة العراقية للعلوم الاحصائية |
| Online Access: | https://stats.mosuljournals.com/article_29111_72da908e827c884158a4b8a92f5eafa6.pdf |