rar

A logical decision-making course scheduling algorithm

  • 2013-09-22
  • 439.69KB
  • Points it Requires : 2

By representing resources such as teachers, classrooms, classes, and time with strings of 0 and 1, and performing AND and OR operations on these strings, we can finally obtain a reasonable class schedule and solve the resource conflict problem in the course scheduling process conveniently and quickly. The simulation experiment proves that the algorithm can meet the multiple constraints of the college course scheduling problem and can solve the college course scheduling problem more effectively.

unfold

You Might Like

Uploader
PKelect
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×