BASIC CONCEPTS FOR SCHEDULING PROBLEM REALIZATION

Author(s): Klevansky Nikolay Nikolaevich

Rubric: Educational environment

Release: 2014-2 (5)

Pages: 9-21

Keywords: scheduling, demand, event, greedy algorithm, multi-criteria, multi-vectorial and hyper-vectorial ranking

Annotation: In the article the basic concepts for scheduling problem are presented. The realizations are based on multi-criteria, multi-vectorial and hyper-vectorial ranking. The classification scheduling problems and basic criteria for choice operations are required. Greedy algorithms are presented.

Bibliography: Klevansky NI.NI. BASIC CONCEPTS FOR SCHEDULING PROBLEM REALIZATION // Education Resources and Technologies. – 2014. – № 2 (5). – С. 9-21. doi: