The Research of Special Laboratory Timetable Algorithm and Solving Conflicting Method


Article Preview

The laboratory timetable problem is an NP combinatorial optimization problem, and it is difficult to get the optimal solution. Under the traditional timetable algorithm, classes are arranged by week, and it is fixed and regular that when and where classes are arranged. Whereas under special laboratory timetable algorithm, teachers need book in advance, classes are arranged by term, and it is very flexible and random. So the traditional timetable algorithm cannot solve the problem of the laboratory timetable. In order to solve this problem, a special laboratory timetable algorithm and a solving conflicting method are presented in this paper. It has been proven that it is a better solution to the laboratory timetable problem, saves a lot of time for the laboratory personnel and is worth further promote the application.



Edited by:

Zhengyi Jiang, Yugui Li, Xiaoping Zhang, Jianmei Wang and Wenquan Sun




J. E. Guo and H. X. Zhang, "The Research of Special Laboratory Timetable Algorithm and Solving Conflicting Method", Applied Mechanics and Materials, Vols. 220-223, pp. 3064-3067, 2012

Online since:

November 2012




[1] Jinyan Huang, Computer Knowledge and Technology. 6(28) (2010) 8035.

[2] Zhigang Ren, Journal of Taiyuan Normal University (Natural Science Edition). 8(4)(2009)42.

[3] Minsuo Jin, Research and Exploration in Laboratory. 29(3) (2010) 66.

[4] Shoukuan Chen, Equipment Manufactring Technology. (4) (2008) 150.

[5] Pan Wang, Shaoping Chen, etc, Modern Educational Technology. 18(10) (2008) 101.

[6] Meilian Chen, Research and Exploration in Laboratory. 28(12) (2009) 210.

[7] Yangyang Chen, Guangqiang Zeng, Computer Knowledge and Technology. 6(22) (2010) 6149.