OPTIMAL SCHEDULING OF GAS STATION ATTENDANT USING
INTEGER LINEAR PROGRAMMING METHOD
(Study On Gas Station 44.574.03 Jonggrangan Klaten)

Dublin Core

Title

OPTIMAL SCHEDULING OF GAS STATION ATTENDANT USING
INTEGER LINEAR PROGRAMMING METHOD
(Study On Gas Station 44.574.03 Jonggrangan Klaten)

Subject

gas stations, employee scheduling, integer linear programming, minimum cost

Description

Gas Station (SPBU) generally serve the needs of consumers 24 hours a day. The
problem of employee scheduling is a problem that is often faced by companies because
scheduling that is not optimal can cause wasted costs. The rules applied by the gas
station company and the limited number of employees are the determining factors in the
preparation of the employee schedule. This scheduling problem can be applied to the
Integer Linear Programming modeling. Integer Linear Programming is a linear
programming calculation model with a linear objective function, linear constraints
function, and integer variables. This employee scheduling problem is solved using the
Integer Linear Programming method with the aim of minimizing employee salary costs
without reducing the number of employees and not ignoring the rules and or constraints
set by the company. This study discusses the problem formulation of gas station employee
scheduling in the form of Integer Linear Programming in a case study at SPBU 44574.03
Jonggrangan Klaten. Mathematical formulations and models were completed with the
help of the LINGO 8.0 computer application.

Creator

Dwi Hastjarja Kustijana B.1, Daniel Jordy Kriswandi,2 Darmanto3

Source

https://jurnal.stie-aas.ac.id/index.php/IJEBAR

Date

2023

Contributor

peri irawan

Format

pdf

Language

english

Type

text

Files

Citation

Dwi Hastjarja Kustijana B.1, Daniel Jordy Kriswandi,2 Darmanto3, “OPTIMAL SCHEDULING OF GAS STATION ATTENDANT USING
INTEGER LINEAR PROGRAMMING METHOD
(Study On Gas Station 44.574.03 Jonggrangan Klaten),” Repository Horizon University Indonesia, accessed April 21, 2025, https://repository.horizon.ac.id/items/show/7467.