We consider an uncapacitated lot-sizing problem in co-production systems, which it is possible to produce multiple items simultaneously a single production run. Each product has deterministic demand be satisfied on time. The decision choose co-produce and the amount of throughout predetermined planning horizon. show that with strongly NP-Hard. Then, we develop various Mixed-Integer Linear Progr...

The discrete gate sizing problem has been studied by several researchers recently. Some Complexity results have been obtained, ana' a number of heuristic algorithms have been proposed. For circuit networks that are restricted to the set of trees, or series-parallel graphs pseudo-polynomial time algorithms to obtain the exact solution have also been proposed, though none can be extended to arbit...

In this paper we describe the model of an actual problem from the chemical industry, for which we developed a planning and lot-sizing tool. The production process is characterized by a two-stage product structure as well as sequence-dependent setup cost and setup times. The develop a model which is a modified version of the General Lot-sizing and Scheduling Problem (GLSP) framework and combines...

This paper describes an automated process for designing electrical circuits in which "What You Want Is What You Get" ("WYWIWYG" – pronounced "wow-eee-wig"). The design process uses genetic programming to produce both the topology of the desired circuit and the sizing (numerical values) for all the components of a circuit. Genetic programming successfully evolves both the topology and the sizing...