The unequal-areas facility layout problem is concerned with finding the optimal arrangement of a given number of non-overlapping indivisible departments with unequal area requirements within a facility. We present an improved optimization-based framework for efficiently finding competitive solutions for this problem. The framework is based on the combination of two mathematical optimization mod...

In this article, we propose a parametric bootstrap (PB) test for testing main, simple and interaction effects in heteroscedastic two-way MANOVA models under multivariate normality. The PB test is shown to be invariant under permutation-transformations, and affinetransformations, respectively.Moreover, the PB test is independent of the choice ofweights used to define the parameters uniquely. The...

Information broadcasting is an effective method to deliver popular files to a large number of users in wireless and satellite networks. In a previous work, we used a dynamic optimization approach to address the problem of broadcast scheduling for a pull system with equal file sizes. In this paper, we address that problem in a more general setting where the file sizes are not equal and have geom...

In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...

The asymptotic behavior of the number of set partitions of an n-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are ...