Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Improving the Fundamental Theorem of Algebra

Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.     

New Non-Linear Inequalities for Flag-Vectors of 4-Polytopes

In this paper we prove four new (infinite) lists of quadratic inequalities, and four cubic inequalities, for the flag f-vectors of 4-polytopes. These extend and supplement the only four currently known non-linear inequalities, which were proved by Bayer in 1987. The new lists of inequalities for flag f-vectors yield new lists of inequalities for f-vectors of 4-polytopes. Using the latter, we managed to improve an estimate discovered by Hoppner and Ziegler concerning upper bounds of f₁ in terms of f₀ and f₃.     

Discrete mathematics in primary and secondary schools in the United States

This article provides a status report on discrete mathematics in America's schools, including an overview of publications and programs that have had major impact. It discusses why discrete mathematics should be introduced in the schools and the authors' efforts to advocate, facilitate, and support the adoption of discrete mathematics topics in the schools. Their perspective is that discrete mathematics should be viewed not only as a collection of new and interesting mathematical topics, but, more importantly, as a vehicle for providing teachers with a new way to think about traditional mathematical topics and new strategies for engaging their students in the study of mathematics.     

Extremal Convex Planar Sets

Each convex planar set K has a perimeter C, a minimum width E, an area A, and a diameter D. The set of points (E,C, A^1/2, D) corresponding to all such sets is shown to occupy a cone in the non-negative orthant of R⁴with its vertex at the origin. Its three-dimensional cross section S in the plane D = 1 is investigated. S lies in a rectangular parallelepiped in R³. Results of Lebesgue, Kubota, Fukasawa, Sholander, and Hemmi are used to determine some of the boundary surfaces of S, and new results are given for the other boundary surfaces. From knowledge of S, all inequalities among E, C ,A, and D can be found.     

An expedient synthesis of an isofervenulin analogue

An efficient approach has been developed for the synthesis of an isofervenulin analogue 1 employing a one‐pot condensation‐substitution reaction of a chlorocarboethoxytriazine (electrophile) with a urea (nucleophile). The resulting cyclization reaction resulted in the synthesis of a pyrimido‐heterocycle in good yield in either acidic or basic media. The former was assisted by utilizing trimethylsilyl chloride.