Traditionally, it is assumed that for solving scheduling problems the information about the availability of users is readily available. How- ever, this often implies a burdensome process of collecting the infor- mation upfront or to operate on incomplete information. In interac- tive scheduling, the scheduler actively involves users by asking them a small number of targeted questions to create an effective schedule. We present a heuristic interactive scheduling framework that utilizes integer linear programming as optimization core, and in particular in- vestigate the timing when to query which users.