A Crew Scheduling System based on Constraint Logic Programming

• Main Authors: Hu,Chih-Ching, 胡志青
• Other Authors: Hsu,Ching-Chi
• Format: Others
• Language: zh-TW
• Published: 1993
• Online Access: http://ndltd.ncl.edu.tw/handle/54350381689637390075

碩士 === 國立臺灣大學 === 資訊工程研究所 === 81 === For most of the scheduling problems, they belong to the NP- problem. For example, crew scheduling, cabin crew scheduling and bus drivers assignment are all the scheduling problems. They are rather complicated and no simple algorithm can solve them efficiently. Even for a specific problem, it is still too difficult to find a good solution. Several researches have been studied, like Operation Research, Artificial Intelligence, Control Theory, etc. We will focus on the cabin crew scheduling problem. For a real life problem, it will have many constraint including hard constraint and soft constraint. The hard constraint must be obeyed and can not be violated and the soft constraint need to be obeyed as possible as we can. The problem still has a lot of requirements which need to be reached under the constraint. Moreover, the problem will have a lot of data which need to be accessed because it is a real life problem. So a data base management system is needed. In this thesis, we will point out the key points of cabin crew scheduling problem. We will discuss how to select a suitable constraint expression for the constraint and how to do the assignment operation, and we will propose the abstraction architecture for our implementation of cabin crew scheduling problem. We will just discuss the concept and the abstraction of the problem. We will not describe the detail about how to implement them.