The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...

SOA (Service Oriented Architecture) is a loosely-coupled architecture designed to tackle the problem of Business/Infrastructure alignment to meet the needs of an organization. A SOA based platform enables the enterprises to develop applications in the form of independent services. To provide scalable service interactions, there is a need to maintain service’s performance and have a good sizing ...

Despite its great applicability in several industries, the combined cutting stock and lot-sizing problem has not been sufficiently studied because of its great complexity. This paper analyses the trade-off that arises when we solve the cutting stock problem by taking into account the production planning for various periods. An optimal solution for the combined problem probably contains non-opti...

An interconnect joining a source and a sink is divided into xed length uniform width wire segments and some adjacent segments have bu ers in between The problem we considered is to simultaneously size the bu ers and the segments so that the Elmore delay from the source to the sink is minimized Previously no polynomial time al gorithm for the problem has been reported in literature In this paper...

This paper presents a new approach using simultaneous voltage-scaling and gate-sizing for low power without violating the timing constraints. We provide the problem formulation in this application, and propose algorithms for single voltagescaling, single gate-sizing, and their simultaneous manipulation. We target a globally optimal solution by showing how the power optimization is related to th...

Ravindra K. Ahuja and Dorit S. Hochbaum Abstract In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two dynamic lot sizing problems (with or without backorders) are minimum cost flow problems on an underlying network that possess a special structure. We show ...

As a traditional model in the operations research and management science domain, deterministic lot-sizing problem is embedded in many application problems such as production and inventory planning and has been consistently drawing attentions from researchers. In this paper we consider basic versions of lot-sizing models in which problem parameters are stochastic and develop corresponding scenar...

Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed-integer programming formulation and Lagrangian relaxation solution procedur...

The multi-stage lot-sizing problem with production capacities (MLSP-PC) deals with a supply chain that consists of a manufacturer with stationary production capacity and intermediaries (distribution centers or wholesalers) and a retailer to face deterministic demand. An optimal supply chain plan for the MLSP-PC specifies when and how many units each organization of the supply chain has to produ...

The paper deals with a stochastic multi-product sequencing and lot-sizing problem for a line that produces items in lots. Two types of uncertainties are considered: random lead time induced by machine breakdowns and random yield to take into account part rejects. In addition, sequence dependent setup times are also included. This study focuses on maximizing the probability of producing a requir...