Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 4
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

It is a usual practice for a contractor to deliver several projects at a time. Typically, the projects involve similar types of works and share the same pool of resources (i.e. construction crews). For this reason, the company’s portfolio of orders considered for a particular planning horizon can be modeled as a project with repeatable processes to be performed in heterogeneous units located in a number of construction sites. Its scheduling requires determining the best sequence of the resources’ moving from unit to unit while minding the due dates related with particular orders as well as resource continuity constraints. The authors present a model of this scheduling problem in the form of a mixed-integer linear program. The aim is to schedule a portfolio of projects in a way that minimizes the total of the resource idle time-related costs, the indirect costs, and the delay penalties. The model can be solved by means of a general-purpose solver. The model is applied to schedule a portfolio of multifamily housing projects.
Go to article

Authors and Affiliations

Piotr Jaśkowski
1
ORCID: ORCID
Sławomir Biruk
1
ORCID: ORCID
Michał Krzemiński
2
ORCID: ORCID

  1. Lublin University of Technology, Faculty of Civil Engineering and Architecture, Nadbystrzycka str. 40, 20-618 Lublin, Poland
  2. Warsaw University of Technology, Faculty of Civil Engineering, Armii Ludowej str. 16, 00-637 Warsaw, Poland
Download PDF Download RIS Download Bibtex

Abstract

The Bulletin of the Polish Academy of Sciences: Technical Sciences (Bull.Pol. Ac.: Tech.) is published bimonthly by the Division IV Engineering Sciences of the Polish Academy of Sciences, since the beginning of the existence of the PAS in 1952. The journal is peer‐reviewed and is published both in printed and electronic form. It is established for the publication of original high quality papers from multidisciplinary Engineering sciences with the following topics preferred: Artificial and Computational Intelligence, Biomedical Engineering and Biotechnology, Civil Engineering, Control, Informatics and Robotics, Electronics, Telecommunication and Optoelectronics, Mechanical and Aeronautical Engineering, Thermodynamics, Material Science and Nanotechnology, Power Systems and Power Electronics.

Journal Metrics: JCR Impact Factor 2018: 1.361, 5 Year Impact Factor: 1.323, SCImago Journal Rank (SJR) 2017: 0.319, Source Normalized Impact per Paper (SNIP) 2017: 1.005, CiteScore 2017: 1.27, The Polish Ministry of Science and Higher Education 2017: 25 points.

Abbreviations/Acronym: Journal citation: Bull. Pol. Ac.: Tech., ISO: Bull. Pol. Acad. Sci.-Tech. Sci., JCR Abbrev: B POL ACAD SCI-TECH Acronym in the Editorial System: BPASTS.

Go to article

Authors and Affiliations

Sanjay Kumar
Chaman Singh
Sada Nand Prasad
Chandra Shekhar
Rajiv Aggrawal
Download PDF Download RIS Download Bibtex

Abstract

This paper presents a Kalman filter based method for diagnosing both parametric and catastrophic faults in analog circuits. Two major innovations are presented, i.e., the Kalman filter based technique, which can significantly improve the efficiency of diagnosing a fault through an iterative structure, and the Shannon entropy to mitigate the influence of component tolerance. Both these concepts help to achieve higher performance and lower testing cost while maintaining the circuit.s functionality. Our simulations demonstrate that using the Kalman filter based technique leads to good results of fault detection and fault location of analog circuits. Meanwhile, the parasitics, as a result of enhancing accessibility by adding test points, are reduced to minimum, that is, the data used for diagnosis is directly obtained from the system primary output pins in our method. The simulations also show that decision boundaries among faulty circuits have small variations over a wide range of noise-immunity requirements. In addition, experimental results show that the proposed method is superior to the test method based on the subband decomposition combined with coherence function, arisen recently.

Go to article

Authors and Affiliations

Xifeng Li Li
Yongle Xie
Dongjie Bi
Yongcai Ao
Download PDF Download RIS Download Bibtex

Abstract

In the paper, the method of a numerical simulation concerning diagonal crack propagation in con-crete beams was presented. Two beams reinforced longitudinally but without shear reinforcement were considered during the Finite Element Method analysis. In particular, a nonlinear method was used to simulate the crack evaluation in the beams. The analysis was performed using the commercial program ANSYS. In the numerical simulation, the limit surface for concrete described by Willam and Warnke was applied to model the failure of concrete. To solve the FEM-system of equations, the Newton-Raphson method was used. As the results of FEM calculations, the trajectories of total stains and numerical images of smeared cracks were obtained for two analyzed beams: the slender beam S5 of leff = 1.8 m and the short beam S3k of leff = 1.1 m. The applied method allowed to generate both flexural vertical cracks and diagonal cracks in the shear regions. Some differences in the evaluation of crack patterns in the beams were observed. The greater number of flexural vertical cracks which penetrated deeper in the beam S5 caused the lower stiffness and the greater deformation in the beam S5 compared to the short beam S3k. Numerical results were compared with the experimental data from the early tests performed by Słowik [3]. The numerical simulation yielded very similar results as the experiments and it confirmed that the character of failure process altered according to the effective length of the member. The proposed numerical procedure was successfully verified and it can be suitable for numerical analyses of diagonal crack propagation in concrete beams.

Go to article

Authors and Affiliations

M. Słowik
P. Smarzewski

This page uses 'cookies'. Learn more