In Dense Wavelength Division Multiplexing (DWDM) technologies, the optimal packet scheduling is a common encounter issue in multiple channels network. NP-hard problem deals with finding a way to rearrange packets in multiple channels into a finite and rare channel. Genetic algorithm (GA) is one of the most efficient ways to solve this issue. We hope to find a better solution to our task through...

High throughput decoding of turbo-codes can be achieved thanks to parallel decoding. However, for finite block sizes, the initialisation duration of each half-iteration reduces the activity of the processing units, especially for higher degrees of parallelism. To solve this issue, a new decoding scheduling is proposed, with a partial processing overlapping of two successive half iterations. Pot...

In this paper, we show how the introduction of a new primitive constraint over finite domains in the constraint logic programming system CHIP allows us to find very good solutions for a large class of very difficult scheduling and placement problems. Examples on the cumulative scheduling problem, the 10 jobs x 10 machines problem, the perfect square problem, the strip packing problem and the in...

An MILP model for the optimal scheduling of a lube oil and paraffin production plant is presented. The plant is composed of processing units that operate in continuous and discontinuous modes, and some are also duplicated. The raw materials for the process are stored in dedicated tanks, and the plant presents finite intermediate storage. The mathematical formulation was developed under a contin...

This paper addresses the problem of integrating in a single model operational optimization and cyclic scheduling of continuous plants. Considered are multiproduct, multistage plants with finite intermediate storage capacity (FIS). A combined optimization approach introduces synergic effects for more effective scheduling and plant operation (Alle and Pinto, 2001a,b). The representation proposed ...

We investigate the minimum-energy packet scheduling problem for the multiaccess channel with K transmitters and a single receiver, assuming that packets arrive at each transmitter’s buffer at arbitrary times and must be transmitted within a finite time window. The offline scheduling problem is formulated and found to be a convex optimization problem with linear constraints. An efficient algorit...

this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.