Extended basic integer programming models for multiple scheduling problems

Abstract

Abstract. Numerous approaches have been done to solve scheduling problems from various fields. Many researchers tend to restrict their models to its' own field. Thus, researchers have to repeat the whole procedure to create a new model to solve another field or aspect of the situation. This whole repetition will be costly and time consuming. The main objective of this study is to develop general basic models to solve multiple scheduling problems. The extended general models formed were based on three types of scheduling problems; nurse, university course and examination with the common requirement obtained in the literature. Additional general constraints were also added to the model. All together there are 6 constraints employed in this research. A 0-1 integer programming is used to construct and solve these models with the support of AIMMS mathematical software. The results obtained showed that the models formed were applicable to all type of scheduling problems with consideration of all similar constraints.