We combine genetic algorithms and case-based reasoning principles to nd optimally directed solutions to open shop scheduling and open shop rescheduling problems. Appropriate solutions to open shop scheduling problems are injected into the genetic algorithm's population to speed up and augment genetic search on a related open shop rescheduling problem. Preliminary results indicate that the combi...

One of my favorite papers about Heartbleed was the one that you wrote with James Kupsch. Tell us about the methods you describe for software assurance and how they worked or didn’t work against the OpenSSL code base. Heartbleed was a wake-up call for a lot of people who were making assumptions about the security of open source software. It was also a wake-up call for people who were depending o...

In this paper, we propose two efficient scheduling algorithms for the total exchange, which is a basic communication pattern used on the GRID environment. Both algorithms are used with the open shop algorithm. The first algorithm is a static scheduling algorithm which partitions messages before the open shop algorithm, and the second algorithm is a dynamic algorithm used in the execution of the...

One-opeator two-machine open shop and ow shop problems are NP-hard in the ordinary sense even if all the weights are the same. We discuss two di erent pseudo polynomial dynamic programming recursions for each of the open shop and ow shop case. Some of the running times are better than those of the best known algorithms in the literature.

Scheduling problems in an open shop is more complicated than others since jobs do not follow a certain route in the system. This study uses computer simulation to compare the performance of different dispatching rules in an open shop. We find that the choice of the best dispatching rule is affected by the utilization factor, due-date factors, and the process time distribution at each station. I...

This is a summary of the journal article (Malapert et al. 2012) published by Journal on Computing entitled “An Optimal Constraint Programming Approach to the Open-Shop Problem”. The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized r...