6533b836fe1ef96bd12a1293

RESEARCH PRODUCT

HEURISTIC PROCEDURES FOR GROUP SCHEDULING

M. PiacentiniV. GrassoA. Masnata

subject

Rate-monotonic schedulingTheoretical computer scienceHeuristic (computer science)Computer scienceGroup (mathematics)Two-level schedulingDynamic priority schedulingFlow shop schedulingFair-share schedulingGroup scheduling

description

ABSTRACT The group scheduling problem is investigated, solving numerous small and large sized examples with eight sequencing algorithms. A new approach, basically consisting in the definition of real machines' idles for each group, utilizing allowed shifting of non critical activities, is proposed. Moreover the CDS multi-shot algorithm is extended to group scheduling.

yearjournalcountryeditionlanguage
1989-01-01
https://doi.org/10.1016/b978-0-08-037199-3.50076-2