The Lab Reservation System Design and Implementation Based on Greedy Algorithm

The paper describes Greedy algorithm, the knapsack problem and it’s 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.