Binary Linear Programming Model in Solving Bus Crew Problem as Tactical Fixed Task Scheduling

In this paper, we consider a crew scheduling problem (CSP) of bus transportation with the objective of minimizing the cost of crew members. We address a different time frame and different type of crew members. The maximum total working limit for each type of crew member has been set. The problem can be formulated as a Tactical Fixed Task Scheduling Problem (TFTSP) where the ready time and due date of the tasks are fixed in advance. A Binary Linear Programming (BLP) model is used to obtain an optimal solution for the problem. We conduct a testing and implement the model using LINGO 17.0 software. Results of the computational testing give optimum values for the problem. Hence, a feasible crew scheduling is obtained.