Search results

The substrate coupling and loss in integrated circuits are analyzed. Then, the authors extract impedances between any numbers of embedded contacts. The paper aims to discuss these issues.

The paper proposes a new substrate network 3D extraction technique, adapted from a transmission line method or Green kernels, but in the whole volume.

Extracting impedances between any numbers of embedded contacts with variable shapes or/and through silicon via. This 3D method is much faster comparing with FEM

Previous works consider TSVs alone, contacts onto the substrate. The authors do study entanglement between the substrate and the interconnections.

In order to improve environmental performance, manufacturing companies around the world have started to seek green practices (GPs) to adopt in their operations. Environmental awareness of the stakeholders has put the pressure and changed the focus of manufacturers. The purpose of this article is to gather GPs used in manufacturing industries through a literature review. It also aims at exploring other elements related to GPs in manufacturing firms.

The paper is exploratory in its approach. After searching relevant research articles from the online database, a review of 103 research articles has been conducted in the area of GPs in manufacturing industries.

This work attempts to offer a comprehensive list of GPs by studying the detailed relevant literature. This paper concludes that the concern of the use of GPs within manufacturing organisations is rising fast around the world, and research in this area is of great interest throughout the world over the last decade.

This study has reported several earlier studies by searching the online database through some selected keywords only, but it has not performed a subjective overview for screening and choosing the research articles. This paper explores and gives a concise description of the GPs in manufacturing that will be helpful for further studies of green manufacturing (GM).

This study provides a comprehensive literature review of GPs in manufacturing industries. This review should give benefits to other scholars and practitioners interested in studying GPs related to manufacturing industries. It might represent new opportunities for relevant research that would contribute to more knowledge of GM being gained.

A layout problem may deal with the assignment and arrangement of buildings in a green field, location and/or relocation of machines/departments in manufacturing facilities, and so on. If multi‐periods are considered, the problem is called a dynamic layout problem in manufacturing environments. Designing web pages, especially internet newspaper layouts, might also be considered dynamic layout problems. This study aims to introduce a layout procedure for the front page of internet newspapers.

The news contents are ranked and selected based on their characteristic attributes. Then they are assigned to locations on dynamic content area of the front page. Layout optimization is made by use of Clonal Selection Algorithm (CSA). Finally, an illustrative example is provided and concepts for real life applications are discussed. The proposed method is based on CSA, which is a nature‐inspired technique. The novel heuristic is applied to a simulated system to depict how the news content layouts can be optimized in dynamic environments.

The capacity for addition of new news contents and removal of the old turns the internet newspaper environment into a dynamic structure. A systematic layout method for internet newspapers is developed to fill the gap.

The results are encouraging for real life applications of internet newspapers. The study has also introduced a new site for the manufacturing area. In the classic dynamic layout model, the machine locations and the number of available machines are assumed to be fixed. But the concept of introducing/removing news contents can be adapted to the machines at the manufacturing facilities.

The paper's value lies in showing that the front page layout is not considered to optimize the locations of the articles. Also, the proposed algorithm is applied to solve these kinds of problems.