The interface of buffer design and cyclic scheduling decisions in deterministic flow lines

In this paper, we address some issues on the interface of buffer design and cyclic scheduling decisions in a multi-product deterministic flow line. We demonstrate the importance of the above interface for the throughput performance of the flow line. In particular, we point out that the use of sequence-independent information, such as workload distribution and variability in processing times among stations, is not adequate to decide the optimal buffer configuration of the flow line. We formulate the buffer design problem for a fixed sequence of jobs as a general resource allocation problem, and suggest two effective heuristics for its solution. For the simultaneous buffer design and cyclic scheduling problem, we suggest an iterative scheme that builds on the effectiveness of the above heuristics. One of the side results of our extensive computational studies on this problem is that the general guidelines of buffer design in single-product flow lines with stochastic processing times are not directly transferable to the multiproduct deterministic flow line environment. © 1994 J.C. Baltzer AG, Science Publishers

Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure

In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem. We subsequently present exact and approximate solution procedures. The exact solution procedure is a branch-and-bound algorithm which uses Lagrangian and station-based relaxations of the integer programming formulation of the problem as the lower bounding method. Our heuristic procedures show a performance superior to the available ones in the literature. Finally, we address the stability issue in cyclic scheduling, demonstrate its relationship to the work-in-progress inventory control of a flow line, and present a very simple procedure to generate stable schedules in flow lines. © 1996 John Wuey & Sons, Inc

On the probabilistic min spanning tree Problem

We study a probabilistic optimization model for min spanning tree, where any vertex vi of the input-graph G(V,E) has some presence probability pi in the final instance G′ ⊂ G that will effectively be optimized. Suppose that when this “real” instance G′ becomes known, a spanning tree T, called anticipatory or a priori spanning tree, has already been computed in G and one can run a quick algorithm (quicker than one that recomputes from scratch), called modification strategy, that modifies the anticipatory tree T in order to fit G ′. The goal is to compute an anticipatory spanning tree of G such that, its modification for any G ′ ⊆ G is optimal for G ′. This is what we call probabilistic min spanning tree problem. In this paper we study complexity and approximation of probabilistic min spanning tree in complete graphs under two distinct modification strategies leading to different complexity results for the problem. For the first of the strategies developed, we also study two natural subproblems of probabilistic min spanning tree, namely, the probabilistic metric min spanning tree and the probabilistic min spanning tree 1,2 that deal with metric complete graphs and complete graphs with edge-weights either 1, or 2, respectively

Algorithm Engineering in Robust Optimization

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions. To this end we go through the algorithm engineering cycle of design and analysis of concepts, development and implementation of algorithms, and theoretical and experimental evaluation. We show that many ideas of algorithm engineering have already been applied in publications on robust optimization. Most work on robust optimization is devoted to analysis of the concepts and the development of algorithms, some papers deal with the evaluation of a particular concept in case studies, and work on comparison of concepts just starts. What is still a drawback in many papers on robustness is the missing link to include the results of the experiments again in the design

Nomenclatural issues concerning cultured yeasts and other fungi: why it is important to avoid unneeded name changes

The unambiguous application of fungal names is important to communicate scientific findings. Names are critical for (clinical) diagnostics, legal compliance, and regulatory controls, such as biosafety, food security, quarantine regulations, and industrial applications. Consequently, the stability of the taxonomic system and the traceability of nomenclatural changes is crucial for a broad range of users and taxonomists. The unambiguous application of names is assured by the preservation of nomenclatural history and the physical organisms representing a name. Fungi are extremely diverse in terms of ecology, lifestyle, and methods of study. Predominantly unicellular fungi known as yeasts are usually investigated as living cultures. Methods to characterize yeasts include physiological (growth) tests and experiments to induce a sexual morph; both methods require viable cultures. Thus, the preservation and availability of viable reference cultures are important, and cultures representing reference material are cited in species descriptions. Historical surveys revealed drawbacks and inconsistencies between past practices and modern requirements as stated in the International Code of Nomenclature for Algae, Fungi, and Plants (ICNafp). Improper typification of yeasts is a common problem, resulting in a large number invalid yeast species names. With this opinion letter, we address the problem that culturable microorganisms, notably some fungi and algae, require specific provisions under the ICNafp. We use yeasts as a prominent example of fungi known from cultures. But viable type material is important not only for yeasts, but also for other cultivable Fungi that are characterized by particular morphological structures (a specific type of spores), growth properties, and secondary metabolites. We summarize potential proposals which, in our opinion, will improve the stability of fungal names, in particular by protecting those names for which the reference material can be traced back to the original isolate

Criticality Analysis of Activity Networks under Interval Uncertainty

Dedicated to the memory of Professor Stefan Chanas - The extended abstract version of this paper has appeared in Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005) ("Interval Analysis in Scheduling", Fortin et al. 2005)International audienceThis paper reconsiders the Project Evaluation and Review Technique (PERT) scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formulation, our goal is to assert possible and necessary criticality of the different tasks and to compute their possible earliest starting dates, latest starting dates, and floats. This paper combines various results and provides a complete solution to the problem. We present the complexity results of all considered subproblems and efficient algorithms to solve them