CAJ | 학술논문

对高校教室调度问题进行研究，能使教室和课程达到一种合理的优化配置。类似问题的研究在制造业或生产系统中都占有非常重要的地位。研究首先采用三元组方式，将教室调度问题描述为一类具有机器适用限制的并行多机问题，以最小化Cmax（即集中时间提高教室利用效率）和滞后时间总和为调度目标，建立了对应的数学模型。根据问题的特性，设计了包含分派规则和遗传算法的启发式调度算法求解该类问题。研究结合问题特性在编码，个体适应度函数，交又及变异等方面进行了设计。以实例分析验证了所设计算法的可行性和有效性。
대고교교실조도문제진행연구，능사교실화과정체도일충합리적우화배치。유사문제적연구재제조업혹생산계통중도점유비상중요적지위。연구수선채용삼원조방식，장교실조도문제묘술위일류구유궤기괄용한제적병행다궤문제，이최소화Cmax（즉집중시간제고교실이용효솔）화체후시간총화위조도목표，건립료대응적수학모형。근거문제적특성，설계료포함분파규칙화유전산법적계발식조도산법구해해류문제。연구결합문제특성재편마，개체괄응도함수，교우급변이등방면진행료설계。이실례분석험증료소설계산법적가행성화유효성。
The timetabling problem in universities is to assign the classrooms into classes. This problem is somehow similar to that of assigning machines into jobs in manufacturing systems to minimize the makespan and tardiness. With this observation, the timetabling problem is described by a triplet as a parallel ma- chine scheduling problem with machine eligibility restrictions. Then, a mathematical model is developed for the problem. By analyzing the features of the model, a heuristic that combines dispatching rules and genetic algorithm is proposed to solve the problem. Techniques for coding, individual fitness, crossover, and mutation are presented to implement the genetic algorithm. The proposed method is tested by using a practical case problem and it is shown to be effective and feasible.