A new adaptively weighted combinatorial dispatching rule for complex scheduling problems

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1994 (EN)
A new adaptively weighted combinatorial dispatching rule for complex scheduling problems (EN)

Tzafestas, S (EN)
Triantafyllakis, A (EN)

N/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

combinatorial dispatching (EN)
scheduling problems (EN)
APPROXIMATION (EN)
SYSTEMS (EN)
AWCD rule (EN)

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

Computer Integrated Manufacturing Systems (EN)

1994


BUTTERWORTH-HEINEMANN LTD (EN)



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