This study aims at analyzing the structure of scheduling for league games and developing a new algorithm and a new computer program for it.
We first classify the requirement conditions of scheduling for league games from the interviews with the person in charge of scheduling games of scheduling in Korea Baseball Organization (KBO) and from other data.
Under these classified conditions, a new algorithm is developed based on "branch and bound algorithm" and "traveling salesman algorithm".
Also, the algorithm is coded in Advanced BASIC language which can be implemented at any personal computer.
This code can be used for scheduling any league games such as, Korean baseball games, American national league, whereby the great amount of time and effort can be saved over the conventional manual operation.
