Maximizing Competency Education and Blended Learning: Insights from Experts

In May 2014, CompetencyWorks brought together twenty-three technical assistance providers to examine their catalytic role in implementing next generation learning models, share each other's knowledge and expertise about blended learning and competency education, and discuss next steps to move the field forward with a focus on equity and quality. Our strategy maintains that by building the knowledge and networks of technical assistance providers, these groups can play an even more catalytic role in advancing the field. The objective of the convening was to help educate and level set the understanding of competency education and its design elements, as well as to build knowledge about using blended learning modalities within competency-based environments. This paper attempts to draw together the wide-ranging conversations from the convening to provide background knowledge for educators to understand what it will take to transform from traditional to personalized, competency-based systems that take full advantage of blended learning

Optimal constrained non-renewable resource allocation in PERT networks with discrete activity times

AbstractIn this paper, we develop an approach to optimally allocate a limited nonrenewable resource among the activities of a project, represented by a PERT-Type Network (PTN). The project needs to be completed within some specified due date. The objective is to maximize the probability of project completion on time. The duration of each activity is an arbitrary discrete random variable and also depends on the amount of consumable resource allocated to it. On the basis of the structure of networks, they are categorized as either reducible or irreducible. For each network structure, an analytical algorithm is presented. Through some examples, the algorithms are illustrated

A classification of predictive-reactive project scheduling procedures.

The vast majority of the project scheduling research efforts over the past several years have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment. During execution, however, a project may be subject to numerous schedule disruptions. Proactive-reactive project scheduling procedures try to cope with these disruptions through the combination of a proactive scheduling procedure for generating predictive baseline schedules that are hopefully robust in that they incorporate safety time to absorb anticipated disruptions with a reactive procedure that is invoked when a schedule breakage occurs during project execution.proactive-reactive project scheduling; time uncertainty; stability; timely project completion; preselective strategies; resource constraints; trade-off; complexity; stability; management; makespan; networks; subject; job;

Discrete flower pollination algorithm for resource constrained project scheduling problem

YesIn this paper, a new population-based and nature-inspired metaheuristic algorithm, Discrete Flower Pollination Algorithm (DFPA), is presented to solve the Resource Constrained Project Scheduling Problem (RCPSP). The DFPA is a modification of existing Flower Pollination Algorithm adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts, such as flower, global pollination, Lévy flight, local pollination. The proposed DFPA is then tested on sets of benchmark instances and its performance is compared against other existing metaheuristic algorithms. The numerical results have shown that the proposed algorithm is efficient and outperforms several other popular metaheuristic algorithms, both in terms of quality of the results and execution time. Being discrete, the proposed algorithm can be used to solve any other combinatorial optimization problems.Innovate UKAwarded 'Best paper of the Month