We consider the wiring or layer assignment problem for edge-disjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see 7]). In this paper, we introduce a more general approach to this problem. For an edge-disjoint layout in the plane resp. in an arbitrary planar layout graph, we give equivalent conditions for the k-layer wirabilit...

The problem of optimal space allocation among interconnecting wires of VLSI chips, in order to minimize their switching power consumption is solved. Necessary and sufficient conditions for the existence of optimal space allocation are derived, stating that every wire must be in equilibrium of its line-to-line weighted capacitance density on its two opposite sides. Two proofs are presented, one ...

This research is to discuss how to solve the problem about clean room space allocation with Monte Carlo approach. We design a software which allocate the clean room space automatically. After 500 times tries and find out the optimal solution. We find that Monte Carlo approach is a good way to solve the problem about space allocation. Through the system, we also can preview the layout of the pla...

All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strateg...

Two algorithms for minimum cut linear arrangement of a class of graphs called p-q dags are proposed. A p-q dag represents the connection scheme of an adder tree, such as Wallace tree, and the VLSI layout problem of a bit slice of an adder tree is treated as the minimum cut linear arrangement problem of its corresponding p-q dag. One of the two algorithms is based on dynamic programming. It calc...

<span lang="EN-US">A novel metaheuristic optimization algorithm based on cuckoo search (CSA) is presented to solve the construction site layout planning problem (CSLP). CSLP a complex with various applications, such as plant layout, and computer chip layout. Many researchers have investigated by applying many algorithms in an exact or heuristic approach. Although both methods yield promis...

Purpose – In spite of having a number of general-purpose algorithms for solving plant layout problems, facility planners may still face a challenging task to adjust these algorithms to handle special, but not uncommon, layout problems. The purpose of this study is to propose a new method for addressing the impact of overhead space utilization on a plant layout solution. Design/methodology/appro...

The efficiency of desktop publishing is severely limited by the lack of sophisticated automatic document layout systems. State-of-the-art algorithms either require the input to be written in a description language such as HTML and LATEX, or to be a manually designed layout template. However, description languages are ill-suited to express layout problems with weak semantics and layout templates...

According to [1], the material handling cost comprises about 20-50% of the total operating cost of the facility layout. Typical research on facility layout concentrate on static layout problems where from-to charts are used to evaluate the layout. These layouts are not flexible enough to accommodate any future changes in production. Research on dynamic facility layout also has used the concept ...