Shift Scheduling Problems in Nanzan University Entrance Ezaminations -Their Formulation and Implementation
We introduce two shift scheduling problems in the administration of the entrance examination of Nanzan University. The first is to make the shift of the student assistants of the entrance examination.We formulate the problem as a network flow problem and solve it as a linear programming problem using an optimization software. The software solves the problem in three seconds by the standard PC. The second is to make a shift of administrative staffs checking the number of answer sheets of the entrance examination.We formulate the problems as a 0-1 integer programming problem.We solve it using the same optimization software.It takes about ten seconds also by the standard PC.
Atsuo Suzuki Kana Yamamoto Naomi Ito Masanori Fushimi
Department of Information Systems and Mathematical Sciences,Nanzan University,27 Seirei,Seto,Aichi 4 Sigma Field Inc. Graduate School of Mathematical Sciences and Information Engineering,Nanzan University
国际会议
张家界
英文
461-468
2009-09-20(万方平台首次上网日期,不代表论文的发表时间)