Automated Course Scheduling System for Naval Training,

: The course scheduling process is labor intensive throughout the Naval Education and Training Command. This process entails generation and maintaining of schedules to meet planned input requirements, subject to the suitability/availability of instructors, training devices, and classroom facilities. The process is further complicated by nonuniform course lengths and start dates, varying class sizes, student/instructor ratios, course resource interactions and dependencies, and delays in resource acquisitions. The purpose of this report is to present the Training Management System (TMS) course scheduling system and to provide a user's guide for the operation of the system. The course scheduling system provides an easy and efficient means of handling the large volume of data necessary to generate a feasible schedule for courses in a schoolhouse. The system is highly interactive and user oriented and is intended for use at the schoolhouse level. The program software is written in BASIC-2 and is designed to operate on a Wang 2200 system. (Author)

The Chief of Naval Education and Training has established a centrally managed, decentrally executed, Instructional Systems Development capability. The first of five planned Instructional Program Development Centers was established in San Diego, California on July 1, 1976. The first rating or occupational specialty to be restructured is the Navy Radioman. A model, whose five phases are Analysis, Design, Development, Implementation and Control, has been selected to carry out ISD within the Naval Education and Training Command.

Scheduling processes have been applied to a wide range of application areas, such as scheduling tasks in operating systems, scheduling facilities at airports, scheduling assembly lines in production, scheduling resources in project management, timetabling in public transportation, and scheduling activities in cyber-physical systems. In general, scheduling problems are not trivial to solve effectively and efficiently. Design and implementation of scheduling software is expensive and time-consuming. This dissertation makes three main contributions: First, we have adopted a feature-oriented Software Product Line Engineering (SPLE) approach. If applied correctly, the SPLE approach provides more economic solutions in case a family of products is developed instead of one product. Companies that develop scheduling systems generally implement product families. After an extensive domain analysis of the theory, the common and variable “features” have been defined. By choosing and configuring the right set of “features”, the designers can efficiently define scheduling systems according to their needs. As a second contribution, to convert the abstract definitions into executable programs, we have designed and implemented an “application framework” called First Scheduling Framework (FSF). We consider reusability and dynamic extensibility as two quality attributes of the framework. To this end, generic “constraint-solvers” are adopted to translate the predefined “scheduling constraints” into the “constraint-language” of the corresponding solver and to use them to solve the translated problem. We have extended our implementation using MDE (Model-Driven Engineering) techniques so that “feature-oriented” models can be easily converted to the abstractions of the “application framework”. As a third contribution, we have expanded our “feature-oriented” approach to a general “model optimization framework”. Scheduling systems can be influenced by many contextual factors, such as the desire for lower energy consumption, more precise computation, and dealing with certain hardware limitations. Due to contextual factors, it can be very difficult to define an optimal system that gives the best compromise for such multiple concerns. For this purpose, we propose OptML Framework, which accepts different models representing the contextual factors in the language of ECORE in the MDE environment and calculates the optimal models that meet user-defined requirements.

In this study, a data mining technique and a genetic algorithm are applied to an automatic course scheduling system to produce course timetables that best suit studentspsila and teacherspsila needs. Course scheduling in colleges and universities is a highly complicated task for satisfying multiple constraints. Conventional course scheduling is done mainly from the schoolpsilas point of view, such that courses and timetables are planned according to the characteristics of individual departments and institutes, with little attention to studentspsila interests and their needs in career development. This study develops a practical automatic course scheduling system based on studentspsila needs, wherein the course scheduling process is divided into two stages. In the first stage, studentspsila needs in course selection are considered and an association among courses selected by students is mined using the association mining technique; while in the second stage, the genetic algorithm is used to arrange the course timetable. More particularly, this study is based on studentspsila willingness in course selection, analyzes the effects of course arrangement in different class periods on studentspsila learning performance, takes into account teacherspsila preferred schedules, determines the cost function value of each class period, and then applies the genetic algorithm for class period exchange, so as to produce an optimal course timetable. It is shown in the experiment results that the automatic course scheduling system proposed in this study not only can efficiently replace the onerous operation of conventional manual course scheduling, but also produce course timetables that truly fulfill userspsila needs and increase studentspsila and teacherspsila satisfaction, thereby providing a win-win-win solution for students, teachers and the school.

Scheduling is the most important thing in Instasi, at the Bali Nusa Dua Convention Center hotel. In this system AC maintenance scheduling is intended for staff technicians at BNDCC hotels. In BNDCC, scheduling still uses a manual system using bookkeeping so that ac maintenance scheduling takes a long time and the resulting schedule information is less effective because the process tends to take a long time and the information generated is less accurate. The purpose of this study is to apply a genetic algorithm to solve optimization problems in scheduling ac maintenance. Genetic algorithms present candidate solutions randomly, then evaluate using the fitness function and then do a selection, then cross-move and mutase. After a few generations the genetic algorithm produces the best schedule. Scheduling In making this scheduling system uses the development of the waterfall method and is designed using the Unified Modeling Language (UML) with the Hypertext Prepprocessing (php) programming language and MySQL as a database. In the scheduling system it has a generate function that generates an AC maintenance schedule automatically. With the scheduling system, the scheduling process can be done quickly and effectively. Besides the scheduling system that is built to display the overall schedule, namely Day, Time, Room, Technician and Job. At the final stage of testing, the system is tested using the blackbox testing method and all tests performed have obtained the appropriate results.

The effect of exercise on myocardial interstitium. An ultrastructural morphometric study

This paper discusses the implementation of a knowledge-based system for the dynamic scheduling of a two-stage production process. It is an interactive, real-time, menu-driven system written in Prolog. The system architecture is delineated and the rules and problem-solving logic to be used under various dynamic situations are described. Results of a sample system test session are included to illustrate its use.

The new Strategic Plan for Air Force 100 is a broad process of restructuring of Aeronautical Command (COMAER). Among the areas of action, the refinement of human resources management is highlighted, with emphasis in the fields of recruitment, selection and training. Immersed in this triad, the aim of this study was to verify the influence of soldiers’ level of schooling during the recruitment stage on the degree of performance obtained at the end of the Soldiers Training Course (CFSd) of 2015 and 2016 teams of the 64 Infantry Battalion (BINFA-64). Directing the discussion, the Theory of Meaningful Learning (TAS) was chosen, which interprets the construction of the individual’s cognitive structure and emphasizes that knowledge preexisting in learners’ mental framework acts as an anchor of knowledge (Subsumption), serving as a support to formation of new knowledge. The Mapping of the research objective was established in two aspects. In the foreground, basing and validating the schooling level records of the 421 soldiers under study was sought at the time of the incorporation. It was verified that the military had complete elementary school degree (3%), incomplete secondary school degree (17%), complete secondary school degree (66%), complete secondary school degree (10%) and incomplete higher education degree (4%). Under another perspective, the research focused on recording the soldiers’ final performance score at the end of the course. School and performance data collected were statistically compared using the Pearson coefficient. The value of 0.85, tested by the coefficient, indicated a strong correlation among the variables. Associated with TAS precepts, from this result it was concluded that the highest performance scores corresponded to the highest school levels.

This paper should provide a short overview of the background, intention and concept of the Training Course for Biomedical/Hospital Technicians. It has been developed to provide technicians in rural areas in developing countries with a basic knowledge and simple techniques for handling and maintenance of medical equipment in health care facilities mainly of the primary up to the secondary level of health care delivery.

In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Scheduling an access service team made up of full-time staff and student workers to ensure a consistent coverage of service points is an important but time-consuming task for access service managers in academic libraries. In order to streamline the redundant efforts and to engage student workers in the scheduling process, the author “built” a scheduling system with a suite of free Google applications, aiming at cutting down schedule-related email exchanges, and booking work shifts directly into student workers’ personal time management tools. A survey among the student workers after 4 months of implementation indicated that this system successfully improved scheduling efficiency and work attendance by motivating the student workers to proactively plan their priorities using online time management tools.

In traditional job scheduling systems for the grid, a single or a few machines handle information of all computing resources and scheduling tasks. This centralized approach is not scalable, since it introduces single point of failure and bottleneck. Some decentralized scheduling systems have been proposed to improve scalability. They avoid concentration of scheduling costs by broadcasting job execution requests in a peer-to-peer style. However, resource utilization tends to be low, because most of them are not aware of the dynamic states of computing resources before throwing execution requests. This paper introduces a decentralized scheduling system that improves resource utilization by using a Gossip-based multicast protocol. With this protocol, peers can gather information of each other efficiently and schedule jobs individually. The simulation shows that our system is scalable and it handles many jobs efficiently in large scale grid environments

This paper reports on the successful development and implementation of an interactive manpower scheduling and planning system for a children’s mental health facility in a large urban hospital centre in Montreal, Canada. This service employs approximately 120 professionals who meet the nursing and therapy needs of between 70 and 100 children at any one time, with a yearly through-put of approximately 120 patients. The system is based on the patient as a central entity and is designed to improve the patient flow and resource scheduling process and to permit the evaluation of policy options in real time.

In order to solve the problem that the decision-making command and emergency response ability of ship damage control commanders is difficult to generate and slow to improve, a dynamic interactive damage control command training system is designed based on the facilities of port and shore damage control, and the technologies virtual and real combination and computer simulation are adopted, which has training functions such as damage perception, damage control plotting, information transmission and decision application. By clarifying the command and disposal process, the system effectively improves the efficiency of damage control command, has strong pertinence and expansibility, and provides an effective training means and a reliable training platform for improving the decision-making ability and level of damage control commanders.

In this poster contribution, we present a scheduling system for automated remote operation of instruments at high-altitude research facilities and similar remote sites. Via web-based interfaces, the system allows instrument owners as well as authorized third-party scientists to schedule and execute measurements and observations.The system has been developed as a thesis project in the context of the AlpEnDAC-II ("Alpine Environmental Data Analysis Centre", www.alpendac.eu) collaboration (funded by the Bavarian State Ministry of the Environment and Consumer Protection). Consequently, the scheduler and interfaces have been integrated with the AlpEnDAC Operating-on-Demand functionalities. A first use case for the framework has been the operation of an airglow imager (FAIM) in Oberpfaffenhofen (DE).We describe the design and implementation of our system for scheduling and execution of multi-user observations on instruments, including scheduling-data transfers and data retrieval. Our core implementation uses an optimization-based scheduler (Google's OR-Tools) to ensure maximum instrument use and to minimize idle times. Results show that the scheduler is reliable, fast, and is consistently able to provide optimal observation plans. The extensibility of the system is guaranteed by the usage of modern software in the core of the system, including well-defined and specified communication through REST APIs. Thus, it can easily be adapted to other settings and instruments, which is also facilitated by a modern deployment strategy using Docker and Kubernetes.