Masbah, N. A. and Nordin, S. Z. and Ahmad, R. (2019) Binary linear programming model in solving bus crew problem as tactical fixed task scheduling. In: 14th International Symposium on Geometric Function Theory and Applications, GFTA 2018, 3-5 Dec 2018, Puri Pujangga Hotel, Universiti Kebangsaan Malaysia Selangor, Malaysia.
|
PDF
1MB |
Official URL: https://dx.doi.org/10.1088/1742-6596/1212/1/012030
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | computation theory, geometry, linear programming |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 89106 |
| Deposited By: | Narimah Nawil |
| Deposited On: | 26 Jan 2021 08:44 |
| Last Modified: | 26 Jan 2021 08:44 |
Repository Staff Only: item control page
