We consider two-dimensional cutting stock problems where single rectangular stocks have to be cut into some smaller rectangular so that the number of stocks needed to satisfy the demands is minimum. In this paper we focus our study to the problem where the stocks have to be cut with guillotine cutting type and fixed orientation of finals. We formulate the problem as an integer programming, wher...

We propose a hybrid procedure based on Bounded Dynamic Programming assisted by linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization, with serial workstations, free interruption of the operations and with production mix restrictions. We performed a computational experiment with 7 instances from a case study related to the Nissan Powertrain plant located in Ba...

The DASH model for Power Portfolio Optimization provides a tool which helps decision-makers coordinate production decisions with opportunities in the wholesale power market. The methodology is based on a stochastic programming model which selects portfolio positions that perform well on a variety of scenarios generated through statistical modeling and optimization. When compared with a commonly...

We describe a set of language extensions to Java to support parallel programming with distribution annotations. The system provides an integrated system of placement annotations on both code and data. This allows the programmer to freely mix data-parallel programming similar to HPF, and taskparallel programming similar to OpenMP. To evaluate the effectiveness of our parallel programming model, ...

HARNESS is an experimental Java-centric metacomputing system based on distributed object oriented technolgy. Its main features are the capability to dynamically assemble, manage and dismantle virtual machines that are reconfigurable both in terms of resources enrolled and in therms of services offered, and the capability to mix and match heterogeneous programming models on demand. In this paper...

With huge progress on data processing frameworks, human programmers are frequently the bottleneck when analyzing large repositories of data. We introduce Yedalog, a declarative programming language that allows programmers to mix data-parallel pipelines and computation seamlessly in a single language. By contrast, most existing tools for data-parallel computation embed a sublanguage of data-para...

This paper applies a mix of aspect-oriented programming (AOP) and logic meta-programming (LMP) to tackle some concerns of/in legacy environments. We present four different problems, and illustrate —with code— how far AOP+LMP gets us. The legacy environments subjected to this treatment encompass the two major players: C, and (of course) Cobol. The aspect code is based on, respectively, Aspicere ...

In web projects it is often necessary to mix XML notation and program notation in a single document or program. In mono-lingual situations, the XML notation is either subsumed in the program or the program notation is subsumed in the XML document. As an introduction we analyze XML notation and programming notation in relation to each other. As the main contribution of the paper we describe a nu...

HARNESS is an experimental Java-centric metacomputing system based on distributed object oriented technolgy. Its main feature is the capability to mix and match heterogeneous programming models on top of virtual machines. HARNESS virtual machines can be dynamically assembled, managed and dismantled under user control and are reconfigurable both in terms of resources enrolled and in terms of ser...