A new adaptively weighted combinatorial dispatching rule for complex scheduling problems

 
This item is provided by the institution :

Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA
see the original item page
in the repository's web site and access all digital files if the item*
share



Semantic enrichment by EKT
Journal part (EN)
Scientific article (EN)
1994 (EN)
A new adaptively weighted combinatorial dispatching rule for complex scheduling problems (EN)
Tzafestas, S (EN)
Triantafyllakis, A (EN)
In this paper, a new adaptively weighted combinatorial dispatching (AWCD) rule is developed which is appropriate for complex scheduling problems with multiple and conflicting criteria. This rule identifies the constraints that are most tight, and adaptively estimates the tightness of each constraint. Previous combinatorial dispatching rules appear as special cases of the AWCD rule. An illustrative small-scale scheduling example is provided, which shows the applicability of the AWCD rule to practical problems. Statistical results obtained using 200 random scheduling problems showed the superiority of the AWCD rule over six other composite or combinatorial rules. © 1994. (EN)
journalArticle (EN)
Operations Research & Management Science (EN)
Computer Science, Interdisciplinary Applications (EN)
combinatorial dispatching (EN)
scheduling problems (EN)
APPROXIMATION (EN)
SYSTEMS (EN)
Engineering, Manufacturing (EN)
AWCD rule (EN)
National Technical University of Athens
Digital Library of National Technical University of Athens | Dspace@NTUA
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά
Computer Integrated Manufacturing Systems (EN)
English
1994 (EN)
http://hdl.handle.net/123456789/11134
1 (EN)
0951-5240 (EN)
15 (EN)
ISI:A1994MV69800002 (EN)
7 (EN)
BUTTERWORTH-HEINEMANN LTD (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)