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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/89106/1/NurAtikaMasbah2019_BinaryLinearProgrammingModel.pdf http://eprints.utm.my/id/eprint/89106/ https://dx.doi.org/10.1088/1742-6596/1212/1/012030 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Language: | English |
| Summary: | 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. |
|---|