Scheduling in service systems: an application in the event-tourism industry

This paper deals with an event-bus tour booked by Bollywood film fans. During the tour, the participants visit selected locations of famous Bollywood films at various sites in Switzerland. Moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour; for organizational reasons, two or more buses cannot stay at the same location simultaneously. The planning problem is how to compute a feasible schedule for each bus such that the total waiting time (primary objective) and the total travel time (secondary objective) are minimized. We formulate this problem as a mixed-integer linear program, and we report on computational results obtained with the Gurobi solver.

A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.

Coalition Structures and Policy Change in a Consensus Democracy

This paper studies the relation between coalition structures in policy processes and policy change. While different factors such as policy images, learning processes, external events, or venue shopping are important to explain policy change, coalition structures within policy processes are often neglected. However, policy change happens as a result of negotiations and coordination among coalitions within policy processes. The paper analyzes how conflict, collaboration, and power relations among coalitions of actors influence policy change in an institutional context of a consensus democracy. Empirically, I rely on a Qualitative Comparative Analysis to conduct a cross-sector comparison of the 11 most important policy processes in Switzerland between 2001 and 2006. Coalition structures with low conflict and strong collaboration among coalitions as well as structures with dominant coalitions and weak collaboration both facilitate major policy change. Competing coalitions that are separated by strong conflict but still collaborate strongly produce policy outputs that are close to the status quo.