Integer Linear Programming Approach to Scheduling Toll Booth Collectors Problem

Nordin Haji Mohamad    and Fatimah Said

doi:10.17485/ijst/2013/v6i5.7

Article

Integer Linear Programming Approach to Scheduling Toll Booth Collectors Problem

VIEWS 1684
PDF 336

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2013/v6i5.7

Year: 2013, Volume: 6, Issue: 5, Pages: 1-6

Original Article

Integer Linear Programming Approach to Scheduling Toll Booth Collectors Problem

Nordin Haji Mohamad^{1 *} and Fatimah Said²

¹Institute of Mathematical Sciences, University of Malaya, [email protected]
² Faculty of Economics and Administration, University of Malaya, [email protected]
*Author For Correspondence
Nordin Haji Mohamad
Institute of Mathematical Sciences,
Email:[email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

A general daily staff scheduling problem with hourly requirement patterns is considered and formulated into an integer linear programming problem. A numerical illustrative example of scheduling toll booth collectors of full-timers and part-timers is presented and solved by LINDO.
Keywords: Integer Linear Program, Scheduling, Toll Booth Collectors.