responsibility in demand networks is one of the most important measures of performance. the concept of agility and flexibility in service and production. variety and changes in demand need more flexible network design that can cope with potential shortage and delay. this paper presents new mathematical model to optimize the design of demand network when there are highly variable demands. it als...

Optimization over l ×m× n integer 3-way tables with given line-sums is NP-hard already for fixed l = 3, but is polynomial time solvable with both l,m fixed. In the huge version of the problem, the variable dimension n is encoded in binary, with t layer types. It was recently shown that the huge problem can be solved in polynomial time for fixed t, and the complexity of the problem for variable ...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

Solving Pell’s equation is of relevance in finding fundamental units in real quadratic fields and for this reason polynomial solutions are of interest in that they can supply the fundamental units in infinite families of such fields. In this paper an algorithm is described which allows one to construct, for each positive integer n, a finite collection, {Fi}, of multi-variable polynomials (with ...

This paper proposes the implementation of context adaptive variable length coder for H.264 video encoder. The implementation is capable of bringing about compression of video sequences as per user specification and is capable of processing high resolution pictures of sizes of up to 1024 x 768 pixels, encoding at a real time frame rate of 25 fps. The variable length coder has been realized using...

Consider systems of two-variable linear equations of the form xi−xj = cij , where the cij ’s are integer constants. We show that even if there is an integer solution satisfying at least a (1− )fraction of the equations, it is Unique-Games-hard to find an integer (or even real) solution satisfying at least an -fraction of the equations. Indeed, we show it is Unique-Games-hard even to find an -go...

In this paper we discuss the generation of strong valid inequalities for (mixed) integer knapsack sets based on lifting of valid inequalities for basic knapsack sets with two integer variables (and one continuous variable). The description of the basic polyhedra can be made in polynomial time. We use superadditive valid functions in order to obtain sequence independent lifting.