Online Class Scheduling System
Online Class Scheduling System
Online Class Scheduling System
CHAPTER I
INTRODUCTION
This chapter deals with an Online class Scheduling System for College
intervals for each course offering and subsequently maximize the department
Our project study aimed to create or class scheduling and loading system by
applying knowledge based approach, appropriate heuristic function and rule sets
to load correct course and allow a search for the best slot on multiple available
slots within the decision support framework. The result of the study indicate the
reduction of time required for the course scheduling and continuous improvement
input or output relation or perform a specific function. It can also refer to the
Page 1 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
procedures.”
produces a great impact in the lives of man, particularly in the field of industry,
that will help the students and the administration or management itself. On its
25th years in the run , the Pamantasan ng Lungsod ng Muntinlupa (PLMUN) the
attached and covers 3-5 rooms a wide blackboard posted schedule in the
student to choose subject need to take for the semester , the proponents was
inspired to develop a system that will be truly beneficial. This compels the
The purpose of this study is to help the students but the know their
schedule using online. This can help the Pamantasan to lessen its manual
processes. The proponents conduct the study entitled “Online Class Scheduling
System” that provides an online access to students to ease their burden seeking
Page 2 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
system will provide the Class Schedule of Students. This system will reflect the
Course Code, Course Subject, Time, Day, Room and Name of the Professor
instruction and students based online class scheduling management system and
to improve efficiency
way of scheduling.
Schedule during flexible times throughout the semester with classroom limitation
or time is block
Page 3 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
manual system of plotting student schedules. Most of the students could not
There are often technical problems were students need to activate their
complete
selected subject by the students. With this kind of setting, Manual System
solution.
Page 4 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
information. .
To develop a system that can be access everywhere with the use of data
connection.
The significant study of the following people who will surely benefit of it.
Computer Studies (CITCS) who were the first beneficiary of the Online Class
Scheduling System. This system will lessen the snail-paced transaction caused
by manual processes.
Page 5 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Employees – This system will ease the burden of the employees in plotting and
checking of the schedules. This study or system will also help to make the
Students – The students may access the system everywhere with the use of
data connection.
conduct similar study on a wider scope, this research will also provide relevant
information that will help them to improve or develop a system which is alike with
Name, Number of Units, Time and Day Scheduled and the Room and Professors
This system will only cover the schedules of the Bachelor of Science Major in
(BSCS) and Associate Computer Technology (ACT) students. The system will be
(CITCS).
Page 6 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
CHAPTER II
This chapter presents the list of related studies and literature that serve. As
guidelines to the proponents in order to pursue the topic entitled “Online Class
and different development are stated and created Related to study of online class
schedule system were this system its help to students to see their schedule via
online. And this research is to guide our developing project for the system.
C# LANGUAGE
to facilitate the exchange of information and services over the Web, and to
object or method without requiring the programmer to write additional code for
each step. Because programmers can build on existing code, rather than
Page 7 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
My SQL
development platform that uses Linux as the operating system, Apache as the
Web server, My SQL as the relational database management system and PHP
SQL is the most popular language for adding, accessing and managing content
in a database. It is most noted for its quick processing, proven reliability, ease
LOCAL LITERATURE
organized flow of transaction and an ease of work concerned on how the manual
the right to update, add and delete records at the same time, tracing the
Schedule System also provides the users to view their schedule as long as the
user or the student is enrolled in the institution and also connected through the
Page 8 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
(MPC). Housed in the Pedro E. Diaz High School in Alabang, Muntinlupa, the
where all offices and classrooms were air-conditioned. At this time MPC
In March 1998, MPC realized its dream of moving from the compact Contessa
Building to its own permanent two-storey building, which was erected at the
In 2002, the construction of the Academic Building was completed with the
third and fourth floors that house the library, auditorium and additional
classrooms. A year later, by virtue of City Ordinance No. 03-089, MPC became a
We proposed this online class Scheduling system because we saw for the
regular student and specially for irregular student is manually and then post their
schedule in bulletin board and after that the interview but during our interview the
Page 9 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
This paper reviews the literature related to the class of scheduling problems that
involve sequence-dependent setup times (costs), an important consideration in
many practical applications. It focuses on papers published within the last
decade, addressing a variety of machine configurations including single machine,
parallel machine, flow shop, and job shop systems and reviews the optimization
and heuristic solution methods used for each category. Since lot sizing is so
intimately related to scheduling, this paper reviews work that integrates these
issues in relationship to each configuration. This paper provides a perspective of
this line of research, gives conclusions, and discusses fertile research
opportunities posed by this class of scheduling problems.
Abstract
Page 10 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Abstract
Abstract
Page 12 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Abstract
Reactive scheduling is essential in any scheduling system to incrementally
reconcile the discrepancies between the generative schedule and current status
of the factory. Typical events requiring the reactive scheduling process include
the delayed delivery of materials, machine breakdown, and failure to meet quality
control standards. To efficiently cope with these unexpected events, a reactive
scheduling procedure is proposed based on the constraint satisfaction approach,
and applied to the reactive adjustment of hot-rolling schedules at steelworks.
Various domain-specific strategies are devised as variable and value-ordering
heuristics to guide the search directions in the reactive scheduling process, and
implemented in a scheduling expert system. From the experiment conducted on
the prototype system developed, we find that the schedule performance is mainly
determined by the variable ordering strategy based on the criticality of scheduling
activities, and it can be further improved by adopting the appropriate value-
ordering strategy based on the least constraining resource heuristic.
Page 13 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 14 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 15 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 16 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Dynamic mapping (matching and scheduling) heuristics for a class of
independent tasks using heterogeneous distributed computing systems are
studied. Two types of mapping heuristics are considered: on-line and batch
mode heuristics. Three new heuristics, one for batch and two for on-line, are
introduced as part of this research. Simulation studies are performed to
compare these heuristics with some existing ones. In total, five on-line
heuristics and three batch heuristics are examined. The on-line heuristics
consider; to varying degrees and in different ways, task affinity for different
machines and machine ready times. The batch heuristics consider these
factors, as well as aging of tasks waiting to execute. The simulation results
reveal that the choice of mapping heuristic depends on parameters such as: (a)
the structure of the heterogeneity among tasks and machines, (b) the
optimization requirements, and (c) the arrival rate of the tasks.
Abstract
One measure of the usefulness of a general-purpose distributed computing system
is the system's ability to provide a level of performance commensurate to the degree
of multiplicity of resources present in the system. A taxonomy of approaches to the
resource management problem is presented in an attempt to provide a common
terminology and classification mechanism necessary in addressing this problem. The
Page 17 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
The availability of powerful microprocessors and high-speed networks as
commodity components has enabled high-performance computing on distributed
systems (wide-area cluster computing). In this environment, as the resources are
usually distributed geographically at various levels (department, enterprise or
worldwide), there is a great challenge in integrating, coordinating and presenting
them as a single resource to the user, thus forming a computational grid. Another
challenge comes from the distributed ownership of resources, with each resource
having its own access policy, cost and mechanism. The proposed Nimrod/G grid-
enabled resource management and scheduling system builds on our earlier work
on Nimrod (D. Abramson et al., 1994, 1995, 1997, 2000) and follows a modular
and component-based architecture enabling extensibility, portability, ease of
development, and interoperability of independently developed components. It
uses the GUSTO (GlobUS TOolkit) services and can be easily extended to
operate with any other emerging grid middleware services. It focuses on the
management and scheduling of computations over dynamic resources scattered
geographically across the Internet at department, enterprise or global levels, with
particular emphasis on developing scheduling schemes based on the concept of
computational economy for a real testbed, namely the Globus testbed (GUSTO).
Abstract:
Page 18 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract:
In high-energy physics, bioinformatics, and other disciplines, we encounter
applications involving numerous, loosely coupled jobs that both access and
generate large data sets. So-called Data Grids seek to harness geographically
distributed resources for such large-scale data-intensive problems. Yet effective
scheduling in such environments is challenging, due to a need to address a
variety of metrics and constraints while dealing with multiple, potentially
independent sources of jobs and a large number of storage, compute, and
network resources. We describe a scheduling framework that addresses these
problems. Within this framework, data movement operations may be either tightly
bound to job scheduling decisions or, alternatively, performed by a decoupled,
asynchronous process on the basis of observed data access patterns and load.
We develop a family of algorithms and use simulation studies to evaluate various
combinations. Our results suggest that while it is necessary to consider the
impact of replication, it is not always necessary to couple data movement and
computation scheduling. Instead, these two activities can be addressed
separately, thus significantly simplifying the design and implementation.
Page 19 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
In this paper we consider the resource-constrained project scheduling
problem (RCPSP) with make span minimization as objective. We propose a
new genetic algorithm approach to solve this problem. Subsequently, we
compare it to two genetic algorithm concepts from the literature. While our
approach makes use of a permutation based genetic encoding that contains
problem-specific knowledge, the other two procedures employ a priority
value based and a priority rule based representation, respectively. Then we
present the results of our thorough computational study for which standard
sets of project instances have been used. The outcome reveals that our
procedure is the most promising genetic algorithm to solve the RCPSP.
Finally, we show that our genetic algorithm yields better results than several
heuristic procedures presented in the literature. © 1998 John Wiley & Sons,
Inc. Naval Research Logistics 45: 733–750, 1998
Abstract
Real life scheduling problems require the decision maker to consider a number of
criteria before arriving at any decision. A solution which is optimal with respect to
a given criterion might be a poor candidate for some other. The trade-offs
involved in considering several different criteria provide useful insights to the
decision maker. Thus considering problems with more than one criterion is more
relevant in the context of real life scheduling problems. Surprisingly, research in
this important field has been scarce when compared to research in single
criterion scheduling. In this paper, we provide a detailed literature survey of
multiple and bacteria problems in scheduling. We also provide a broad
classification scheme for scheduling problems.
Page 20 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract:
Today scientific applications have huge data requirements which continue to
increase drastically every year. These data are generally accessed by many
users from all across the globe. This implies a major necessity to move huge
amounts of data around wide area networks to complete the computation cycle,
which brings with it the problem of efficient and reliable data placement. The
current approach to solve this problem of data placement is either doing it
manually, or employing simple scripts which do not have any automation or fault
tolerance capabilities. Our goal is to make data placement activities first class
citizens in the Grid just like the computational jobs. They will be queued,
scheduled, monitored, managed, and even check-pointed. More importantly, it
will be made sure that they complete successfully and without any human
interaction. We also believe that data placement jobs should be treated
differently from computational jobs, since they may have different semantics and
different characteristics. For this purpose, we have developed Stork, a scheduler
for data placement activities in the grid.
Foreign Literature
Abstract
devote a large amount of human and material resources to every year. We have
and the user may set the objectives and parameters from among a wide range of
possibilities. It has a user-friendly interface for the user to input the relevant data
and obtain the corresponding results. The optimization process is based on a set
Page 21 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
of heuristic algorithms. The core is a Tabu Search procedure for which several
strategies have been developed and tested in order to get a fast and powerful
algorithm. The first tests of the package have produced satisfactory results.
Abstract
Reactive scheduling is essential in any scheduling system to incrementally
reconcile the discrepancies between the generative schedule and current status
of the factory. Typical events requiring the reactive scheduling process include
the delayed delivery of materials, machine breakdown, and failure to meet quality
control standards. To efficiently cope with these unexpected events, a reactive
scheduling procedure is proposed based on the constraint satisfaction approach,
and applied to the reactive adjustment of hot-rolling schedules at steelworks.
Various domain-specific strategies are devised as variable and value-ordering
heuristics to guide the search directions in the reactive scheduling process, and
implemented in a scheduling expert system. From the experiment conducted on
the prototype system developed, we find that the schedule performance is mainly
determined by the variable ordering strategy based on the criticality of scheduling
activities, and it can be further improved by adopting the appropriate value-
ordering strategy based on the least constraining resource heuristic.
Abstract
Page 22 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Abstract
Page 23 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
interface. To test the validity of the latter characteristics, we incorporated the NWS
(Network Weather Service) system, which monitors and forecasts global computing
systems behavior. Experiments were conducted by running NWS under a real
environment versus a Bricks-simulated environment, given the observed parameters
of the real environment. We observed that Bricks behaved in the same manner as
the real environment, and NWS also behaved similarly, making quite comparative
forecasts under both environments
Abstract
Page 24 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
intensity, and timing of changes made to students' course schedules are used to
illustrate the disruptive nature of the process.
Abstract
Abstract
This paper reviews the literature on 4x4 block scheduling. Studies reveal that the
advantages of such scheduling are simplicity, potential for greater student
Page 25 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 26 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
students in both the AO. and the AO? Conditions scored significantly higher on
the tests than did the control group. The researchers interpreted these findings
as supporting the premise that it is significantly better to incorporate an advance
organizer with video than not, and as indicating that both declarative and
interrogative AOs can facilitate extensive listening in the FL classroom.
Abstract:
Foreign Studies
Information Systems
provide information about their schedule. The information society maybe virtual
society.
Page 27 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
proposed software will improve this liability and allows the teacher more time
student. This will allow the teacher to feel more job satisfaction as well giving the
student the feeling of a more personalized education within the system. Software
with automatic scheduling for student that can be easily access to internet
anytime.
The Southern California Community College Long Beach City College has
gone live with a Cognos-Based faculty and student scheduling management
system that was designed by Irvine, CA-base professional services firm e2e
Analytics. Priorto installing the new system. LBCC, which has two main
campuses and multiple satellites that support nine schools and 34
departments. The school’s scheduling management system budgeting and
planning up to three months to compile, consolidate, and implement.
Updating and checking of faculty and students Information was inspired by
the advancement of modern technology. The researchers gathered data
necessary in the scheduling system for the success of the study providing
benefit of the employees and students so they can have access and have
access and have the ability to manage information directly and conveniently
Abstract
Page 28 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Long Beach City College has gone live with a Cognos-Based faculty and
students schedule management system that was designed by Irvine, The schools
schedule management system planning and implement and updating and
checking of faculty and students Information was inspired by the advancement of
modern technology. The schedule system management is also used to view and
give the access to the students search their rooms, subjects and faculty
members in the school
CLASS SCHEDULES
ABSTRACT
A college degree is at your fingertips when you register for classes at West
Virginia State University. Whether day, night, or online, we have a variety of
courses that will meet your academic needs. Take a moment to review all the
general information that you need to know about getting registered and then visit
the class schedule so you can register today
Abstract
This review surveys recent documents previously announced in RIE that are
concerned with flexible-modular scheduling. Benefits derived from innovative
scheduling techniques range across the entire spectrum of the educational
experience, frequently providing for substantial change in the roles of students,
teachers, and administrators. Under such a scheduling system, students can
choose instruction individualized to meet their needs and teachers can assume
greater participation in both curriculum planning and the development of new
instructional methods. In addition, administrators can choose from multiple
alternatives for organizing the school day and for managing time and space use
in their schools. (Author/EA)
ABSTRACT
Page 29 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Modular scheduling was introduced in the academic year 1967-68 at North Miami
Senior High School. After a year's operation under the Stanford School
Scheduling System, an "at home" evaluation of the new program was made.
Student grades on a cross-sectional basis did not suffer, but rather showed a
slight improvement. Moderate improvement was also noted in class conduct and
attendance. In the use of unstructured time, a positive change was also observed
in students' attitudes toward study. Large/small group study was favorably
accepted by students and teachers, but more attention to the small group design
for in depth discussion and personal interaction is needed to provide even
greater success. At the administrative level, general commitment to the program
is widespread, yet agreement on philosophies and educational assumptions of
Page 30 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
the program could increase. Generally there has been a movement toward more
individualized instruction. The report recommends that particular emphasis for
further improvement be placed on staff differentiation and use as well as on
further development of the new teaching techniques offered by modular
scheduling. (LN)
Abstract
Abstract
Page 31 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 32 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Abstract
Page 33 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
Create Shortcut
Information
ADMIN
List of Subjects
Online class
Encoded to the selected section
Scheduling
List of Sections & Year
Irregular Section
Create Schedule
Page 34 of 35
PAMANTASAN NG LUNGSOD NG MUNTINLUPA
College of Information Technology and Computer Studies
The diagram display a chosen subject, rooms, section. The history is to detect if
the students are irregular or not. It can creates your own schedule and section for
CITCS students.
Using data flow diagram, the process of online class scheduling system is easy
to understand how the program will flow. Data flow aids in describing the
component, also DFD support the logic behind the dataflow within the system.
Page 35 of 35