Thecomposition of semi finished inventories at a solid board plant

A solid board factory produces rectangular sheets of cardboard in two different formats, namely large formats and small formats. The production process consists of two stages separated by an inventory point. In the first stage a cardboard machine produces the large formats. In the second stage a part of the large formats is cut into small formats by a separate rotary cut machine. Due to very large setup times, technical restrictions, and trim losses, the cardboard machine is not able to produce these small formats. The company follows two policies to satisfy customer demands for rotary cut format orders. When the company applies the first policy, then for each customer order an ‘optimal’ large format (with respect to trim loss) is determined and produced on the cardboard machine. In case of the second policy, a stock of a restricted number of large formats is determined in such a way that the expected trim loss is minimal. The rotary cut format order then uses the most suitable standard large format from the stock. Currently, the dimensions of the standard large formats in the semi finished inventory are based on intuitive motives, with an accent on minimizing trim losses. From the trim loss perspective it is most efficient to produce each rotary cut format from a specific large format. On the other hand, if there is only one large format in each caliper, the variety is minimal, but the trim loss might be inacceptably high. On average, the first policy results in a lower trim loss. In order to make efficiently use of the two machines and to meet customer’s due times the company applies both policies. In this paper we concentrate on the second policy, taking into account the various objectives and restrictions of the company. The purpose of the company is to have not too many different types of large formats and an acceptable amount of trim loss. The problem is formulated as a minimum clique covering problem with alternatives (MCCA), which is presumed to be NP-hard. We solve the problem by using an appropriate heuristic, which is built into a decision support system. Based on a set of real data, the actual composition of semi finished inventories is determined. The paper concludes with computational experiments.

Adaptive Wireless Networking

This paper presents the Adaptive Wireless Networking (AWGN) project. The project aims to develop methods and technologies that can be used to design efficient adaptable and reconfigurable mobile terminals for future wireless communication systems. An overview of the activities in the project is given. Furthermore our vision on adaptivity in wireless communications and suggestions for future activities are presented

Mapping DSP algorithms to a reconfigurable architecture Adaptive Wireless Networking (AWGN)

This report will discuss the Adaptive Wireless Networking project. The vision of the Adaptive Wireless Networking project will be given. The strategy of the project will be the implementation of multiple communication systems in dynamically reconfigurable heterogeneous hardware. An overview of a wireless LAN communication system, namely HiperLAN/2, and a Bluetooth communication system will be given. Possible implementations of these systems in a dynamically reconfigurable architecture are discussed. Suggestions for future activities in the Adaptive Wireless Networking project are also given

Ghost writing: the work of Muriel Spark

No abstract available

Strict versions of various matrix hierarchies related to SL(n)-loops and their combinations

Let $\mathfrak{t}$ be a commutative Lie subalgebra of ${\rm sl}_{n}(\mathbb{C})$ of maximal dimension. We consider in this paper three spaces of $\mathfrak{t}$-loops that each get deformed in a different way. We require that the deformed generators of each of them evolve w.r.t. the commuting flows they generate according to a certain, different set of Lax equations. This leads to three integrable hierarchies: the $({\rm sl}_{n}(\mathbb{C}), \mathfrak{t})$-hierarchy, its strict version and the combined $({\rm sl}_{n}(\mathbb{C}), \mathfrak{t})$-hierarchy. For $n=2$ and $\mathfrak{t}$ the diagonal matrices, the $({\rm sl}_{2}(\mathbb{C}), \mathfrak{t})$-hierarchy is the AKNS-hierarchy. We treat their interrelations and show that all three have a zero curvature form. Furthermore, we discuss their linearization and we conclude by giving the construction of a large class of solutions.Comment: 26 pages. arXiv admin note: text overlap with arXiv:1708.0684