Effective heuristics for solving dynamic variant of single processor total tardiness problems
This paper considers the dynamic variant of single processor scheduling problem of minimizing total tardiness. In practice, it occurs when minimizing tardiness penalty. The problem is NP-hard; thus two heuristics were proposed. The utility of the proposed models was demonstrated through computationa...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Growing Science
2018-01-01
|
| Seri Bilgileri: | Journal of Project Management |
| Konular: | |
| Online Erişim: | http://www.growingscience.com/jpm/Vol3/jpm_2017_16.pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|