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...
Main Authors: | , , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.utm.my/89106/1/NurAtikaMasbah2019_BinaryLinearProgrammingModel.pdf |
_version_ | 1796864763146272768 |
---|---|
author | Masbah, N. A. Nordin, S. Z. Ahmad, R. |
author_facet | Masbah, N. A. Nordin, S. Z. Ahmad, R. |
author_sort | Masbah, N. A. |
collection | ePrints |
description | 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. |
first_indexed | 2024-03-05T20:46:42Z |
format | Conference or Workshop Item |
id | utm.eprints-89106 |
institution | Universiti Teknologi Malaysia - ePrints |
language | English |
last_indexed | 2024-03-05T20:46:42Z |
publishDate | 2019 |
record_format | dspace |
spelling | utm.eprints-891062021-01-26T08:44:39Z http://eprints.utm.my/89106/ Binary linear programming model in solving bus crew problem as tactical fixed task scheduling Masbah, N. A. Nordin, S. Z. Ahmad, R. QA Mathematics 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. 2019 Conference or Workshop Item PeerReviewed application/pdf en http://eprints.utm.my/89106/1/NurAtikaMasbah2019_BinaryLinearProgrammingModel.pdf 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. https://dx.doi.org/10.1088/1742-6596/1212/1/012030 |
spellingShingle | QA Mathematics Masbah, N. A. Nordin, S. Z. Ahmad, R. Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title | Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title_full | Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title_fullStr | Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title_full_unstemmed | Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title_short | Binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
title_sort | binary linear programming model in solving bus crew problem as tactical fixed task scheduling |
topic | QA Mathematics |
url | http://eprints.utm.my/89106/1/NurAtikaMasbah2019_BinaryLinearProgrammingModel.pdf |
work_keys_str_mv | AT masbahna binarylinearprogrammingmodelinsolvingbuscrewproblemastacticalfixedtaskscheduling AT nordinsz binarylinearprogrammingmodelinsolvingbuscrewproblemastacticalfixedtaskscheduling AT ahmadr binarylinearprogrammingmodelinsolvingbuscrewproblemastacticalfixedtaskscheduling |