The Lab Reservation System Design and Implementation Based on Greedy Algorithm

Author

Niu Yan ; Li Jun ; Li Lala

Author_Institution

Comput. Sch., Hubei Univ. of Technol., Wuhan, China

fYear

2009

fDate

11-12 July 2009

Firstpage

495

Lastpage

498

Abstract

The paper describes greedy algorithm, the knapsack problem and itpsilas their related theory, In order to achieve the greatest scope of students benefits and improving the efficiency of the use of the laboratory. It puts forward a dynamic programming algorithm of the three value models based on greedy algorithm. Via the combined value of three model and weight proportion parameter settings, the relevant sorting algorithm and search algorithm, the way achieves an effective approximation of the overall optimization and coordinates the various objects possible conflict.

Keywords

computational complexity; dynamic programming; educational courses; greedy algorithms; knapsack problems; search problems; sorting; student experiments; dynamic programming algorithm; experiment course reservation problem; greedy algorithm complexity; knapsack problem; lab reservation system design; search algorithm; sorting algorithm; teaching method; three value model; weight proportion parameter setting; Approximation algorithms; Content management; Dynamic programming; Education; Electronic mail; Greedy algorithms; Heuristic algorithms; Laboratories; Paper technology; Research and development management; Dynamic Programming; Knapsack algorithm; reservation system; the scope of benefits; the three value models;

fLanguage

English

Publisher

ieee

Conference_Titel

Services Science, Management and Engineering, 2009. SSME '09. IITA International Conference on

Conference_Location

Zhangjiajie

Print_ISBN

978-0-7695-3729-0

Type

conf

DOI

10.1109/SSME.2009.34

Filename

5233240