Abstract: Airplane cabin cleaning service plays an important part in ground support service in airport. By analyzing the characteristic of the cabin cleaning staff scheduling problem which takes into consideration certainty factors such as required individuals and qualifications and uncertainty ones such as the start time and the end time of cabin cleaning tasks, a 0-1 integer programming model containing conflict probability γ is first built with the objective of maximizing the number of scheduling tasks and minimizing the probability of waiting for service. Second, the task conflict probability γ is proposed to describe the conflict degree of the time window between tasks. Third, taking the probability of intertask conflict γ as a main constraint, the effect of γ on scheduling results is studied. Finally, a series of test examples derived from scheduling practice of an airport is proposed, and the results verify the effectiveness of the model and the practicability of conflict probability γ and is helpful for the cabin cleaning service dispatcher to select a better scheme when making the service plan for cleaning staff.