CHAPTER THREE

3.0 INTRODUCTION
In designing and implementing a computer-based scheduling system for our transport
company, I have meticulously structured a methodology that encompasses the essential steps
to achieve our project objectives. The methodology serves as a roadmap, guiding the
systematic development and deployment of the scheduling system to optimize operational
efficiency and streamline our transportation processes. In this section, I outline the key
components of our methodology, detailing the research design, data collection methods, and
implementation strategy.

To commence our methodology, I conducted a thorough analysis of the existing

scheduling processes within our transport company, identifying key pain points and areas for
improvement. This initial assessment informed the development of our research design,
which adopts a mixed-methods approach to gather both qualitative and quantitative data.
Through interviews with stakeholders, observation of current practices, and analysis of
historical data, we aim to gain comprehensive insights into the requirements and challenges
of our scheduling system.

The methodology proceeds with the design and development of the computer-based
scheduling system. Leveraging industry best practices and technological advancements, we
prioritize user-centric design principles to ensure an intuitive and efficient user interface.
Simultaneously, we integrate advanced algorithms for route optimization and resource
allocation, aiming to enhance operational efficiency and cost-effectiveness. Throughout the
implementation phase, we remain committed to iterative testing and feedback loops, allowing
for continuous refinement and improvement of the scheduling system.

Following the introduction to the methodology, the next step is to outline the proposed
design of the computer-based scheduling system for the transport company. This involves
detailing the architecture, features, and functionalities of the system based on the research
findings and objectives of the project. The proposed design should address the identified
requirements and challenges of the current scheduling processes while leveraging innovative
technologies and best practices to optimize operational efficiency and improve overall
performance.
3.1 PROPOSED DESIGN

In alignment with the outlined methodology, this section presents the proposed design
for the computer-based scheduling system tailored for our transport company. The design
aims to address the identified requirements and challenges of our scheduling processes while
leveraging innovative technologies and best practices to optimize operational efficiency and
improve overall performance. The proposed design encompasses various components,
including the user interface, database structure, algorithmic modules, and integration with
existing systems, reflecting a comprehensive and user-centric approach to scheduling
optimization.

3.1.1 USER INTERFACE DESIGN

At the core of the proposed design is an intuitive user interface that empowers operators
and administrators to efficiently manage scheduling data. Utilizing user-centered design
principles, the interface will be visually appealing, easy to navigate, and optimized for
seamless interaction. Iterative design iterations and user feedback will inform the
development process, ensuring that the interface meets the specific needs and preferences of
users, facilitating efficient data input, retrieval, and management.

3.1.2 DATABASE STRUCTURE

The proposed design includes a robust database structure capable of storing and retrieving
scheduling information with speed and reliability. A relational database model will be
implemented, designed to accommodate the complex data relationships inherent in
scheduling operations. By adhering to industry best practices and standards, the database will
ensure data integrity, scalability, and flexibility, allowing for future expansion and integration
with other systems.
3.1.3 ALGORITHMIC MODULES

Advanced algorithmic modules will be integrated into the system to automate route
planning, resource allocation, and scheduling optimization. These modules will leverage
state-of-the-art techniques such as machine learning and optimization algorithms to optimize
scheduling decisions and improve overall efficiency. Through continuous refinement and
optimization, the algorithmic modules will adapt to changing operational conditions and
dynamically adjust scheduling strategies to maximize performance.

3.2 APPLICATION STRUCTURE

The application architecture defines the structure and behaviour of the computer-based
scheduling system. It outlines the components, their interactions, and the flow of data within
the system. The architecture is designed to optimize operational efficiency, scalability, and
flexibility while ensuring reliability and performance.

3.2.1 COMPONENTS

i. User Interface (UI): The UI component provides an interface for operators and
administrators to interact with the scheduling system. It includes screens for inputting
scheduling data, viewing schedules, and managing resources.
 ii. Backend Services: The backend services handle the core business logic of the
scheduling system. This includes algorithms for route optimization, resource
allocation, and scheduling optimization. It also manages interactions with the database
and external systems.

iii. Database: The database component stores and retrieves scheduling data, including
routes, resources, schedules, and historical data. It is designed using a relational
database model for data integrity and scalability.

3.2.2 INTERACTIONS

i. UI to Backend Services: The UI component interacts with the backend services to

input scheduling data, view schedules, and manage resources. It sends requests to the
backend services and receives responses to update the UI accordingly.
ii. Backend Services to Database: The backend services interact with the database to
retrieve scheduling data, perform computations, and store updated data. It executes
queries and transactions to read from and write to the database.
iii. Integration Layer to External Systems: The integration layer communicates with
external systems to exchange data and synchronize information. It sends and receives
data using APIs and data exchange protocols to integrate with GPS tracking systems,
ERP systems, and CRM systems.

3.2.3 STRUCTURE

i. Layered Architecture: The application architecture follows a layered

approach, with separate layers for presentation, business logic, and data
access. This ensures separation of concerns and modularity, making the
system easier to maintain and scale.
 ii. Model-View-Controller (MVC) Pattern: The UI component follows the
MVC pattern, with separate modules for the model (data), view
(presentation), and controller (business logic). This promotes code
reusability and maintainability.

iii. Service-Oriented Architecture (SOA): The backend services are designed as

independent, reusable components that encapsulate business logic. This
follows the principles of service-oriented architecture, allowing for loose
coupling and flexibility.

iv. Database Design: The database component is designed using a normalized

relational database model to ensure data integrity and minimize redundancy.
It includes tables for routes, resources, schedules, and historical data, with
relationships defined using foreign keys.
 User Interface UI )

Backend Service Integration Layer Database

Existing System

Fig 1

3.3 MATHEMATICAL REPRESENTATION

To mathematically represent a scheduling problem, we start by defining an objective
function that represents the criterion we want to optimize. The objective function serves as a
measure of the performance of the scheduling solution. Common objectives include
minimizing the total completion time, minimizing the total cost, or maximizing the
throughput. For instance, in a scheduling problem where we aim to minimize the total
completion time, the objective function can be formulated as the summation of completion
times for all tasks. Mathematically, this can be represented as the summation of \( C_j \) over
all tasks \( j \), where \( C_j \) represents the completion time of task \( j \). Additionally, we
may introduce coefficients to represent the cost associated with each task, leading to a more
general objective function such as \( \text{Minimize} \sum_{j=1}^{n} C_j \cdot
C_{\text{cost}} \), where \( C_{\text{cost}} \) represents the cost coefficient associated with
task \( j \).
In addition to the objective function, scheduling problems typically involve various
constraints that must be satisfied in the solution. These constraints ensure that the solution
meets specific requirements and operational constraints. Common constraints include
resource constraints, time constraints, precedence constraints, and time windows. Resource
constraints limit the total amount of resources that can be allocated at any given time.
Mathematically, this can be represented as the summation of resource allocations for all tasks
being less than or equal to the maximum available resources. Time constraints specify the
temporal relationships between tasks, ensuring that certain tasks are scheduled before or after
others. Precedence constraints dictate that certain tasks must be completed before others can
start, ensuring proper sequencing. Mathematically, this can be represented as \( S_j \geq S_i +
P_i \) if task \( i \) precedes task \( j \), where \( S_j \) and \( S_i \) represent the start times of
tasks \( j \) and \( i \) respectively, and \( P_i \) represents the processing time of task \( i \).
Time windows define allowable time intervals during which tasks can be scheduled.
Mathematically, this can be represented as \( S_j \in [TW_j^{\text{start}},
TW_j^{\text{end}}] \), where \( TW_j^{\text{start}} \) and \( TW_j^{\text{end}} \)
represent the start and end times of the time window for task \( j \) respectively.

To solve the scheduling problem mathematically, decision variables are introduced to

represent the variables that we are trying to optimize. Common decision variables in
scheduling problems include the start time of tasks, the completion time of tasks, and the
assignment of resources to tasks. These decision variables capture the key aspects of the
scheduling problem and provide the basis for formulating the objective function and
constraints. By manipulating these decision variables, we can explore different scheduling
scenarios and find the optimal solution that minimizes the objective function while satisfying
all constraints. Mathematically, decision variables can be represented as \( S_j \) for the start
time of task \( j \), \( C_j \) for the completion time of task \( j \), and \( R_{ij} \) for the
assignment of resource \( i \) to task \( j \).