« Projekte
Development of algorithms for single-stage scheduling problems
Projektbearbeiter:
Vakhania, Werner
Finanzierung:
Fördergeber - Sonstige;
In this project, single-stage scheduling problems (i.e,. single and parallel machine problems) are considered. While many of these problems are NP-hard, the development of polynomial algorithms for special cases of such problems is of interest. We investigate
e.g. parallel machine problems, where the maximal processing time is a constant or where the number of possible different processing times is restricted. Parts of this project are supported by DAAD and by CONACyT.

Schlagworte

parallel machine problems, polynomial algorithm, schedulig, single machine problems
Kontakt

weitere Projekte

Die Daten werden geladen ...