Search results

Ready-mix concrete delivery problem (RMCDP), a specific version of the vehicle routing problem (VRP), is a relevant supply-chain engineering task for construction management with various formulations and solving methods. This problem can range from a simple scenario involving one source, one material and one destination to a more challenging and complex case involving multiple sources, multiple materials and multiple destinations. This paper presents an Internet of Things (IoT)-supported active building information modeling (BIM) system for optimized multi-project ready-mix concrete (RMC) delivery.

The presented system is BIM-based, IoT supported, dynamic and automatic input/output exchange to provide an optimal delivery program for multi-project ready-mix-concrete problem. The input parameters are extracted as real-time map-supported IoT data and transferred to the system via an application programming interface (API) into a mixed-integer linear programming (MILP) optimization model developed to perform the optimization. The obtained optimization results are further integrated into BIM by conventional project management tools. To demonstrate the features of the suggested system, an RMCDP example was applied to solve that included four building sites, seven eligible concrete plants and three necessary RMC mixtures.

The system provides the optimum delivery schedule for multiple RMCs to multiple construction sites, as well as the optimum RMC quantities to be delivered, the quantities from each concrete plant that must be supplied, the best delivery routes, the optimum execution times for each construction site, and the total minimal costs, while also assuring the dynamic transfer of the optimized results back into the portfolio of multiple BIM projects. The system can generate as many solutions as needed by updating the real-time input parameters in terms of change of the routes, unit prices and availability of concrete plants.

The suggested system allows dynamic adjustments during the optimization process, andis adaptable to changes in input data also considering the real-time input data. The system is based on spreadsheets, which are widely used and common tool that most stakeholders already utilize daily, while also providing the possibility to apply a more specialized tool. Based on this, the RMCDP can be solved using both conventional and advanced optimization software, enabling the system to handle even large-scale tasks as necessary.

Project managers bear the responsibility of selecting and developing resource scheduling methods that align with project requirements and organizational circumstances. This study focuses on resource-constrained project scheduling in multi-project environments. The research simplifies the problem by adopting a single-project perspective using gain coefficients.

It employs uncertainty theory and multi-objective programming to construct a model. The optimal solution is identified using Matlab, while LINGO determines satisfactory alternatives. By combining these methods and considering actual construction project situations, a compromise solution closely approximating the optimal one is derived.

The study provides fresh insights into modeling and resolving resource-constrained project scheduling issues, supported by real-world examples that effectively illustrate its practical significance.

The research highlights three main contributions: effective resource utilization, project prioritization and conflict management, and addressing uncertainty. It offers decision support for project managers to balance resource allocation, resolve conflicts, and adapt to changing project demands.

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling.

The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems.

In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation.

This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects.

Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory results cannot be obtained for large construction projects. In this study, a hybrid heuristic meta-heuristic algorithm that adapts the search domain is developed to solve the large-scale discrete TCTP more efficiently.

Minimum cost slope–based heuristic network analysis algorithm (NAA), which eliminates the unfeasible search domain, is embedded into differential evolution meta-heuristic algorithm. Heuristic NAA narrows the search domain at the initial phase of the optimization. Moreover, activities with float durations higher than the predetermined threshold value are eliminated and then the meta-heuristic algorithm starts and searches the global optimum through the narrowed search space. However, narrowing the search space may increase the probability of obtaining a local optimum. Therefore, adaptive search domain approach is employed to make reintroduction of the eliminated activities to the design variable set possible, which reduces the possibility of converging into local minima.

The developed algorithm is compared with plain meta-heuristic algorithm with two separate analyses. In the first analysis, both algorithms have the same computational demand, and in the latter analysis, the meta-heuristic algorithm has fivefold computational demand. The tests on case study problems reveal that the developed algorithm presents lower total project costs according to the dependent t-test for paired samples with α = 0.0005.

In this study, TCTP is solved without considering quality or restrictions on the resources.

The proposed method enables to adapt the number of parameters, that is, the search domain and provides the opportunity of obtaining significant improvements on the meta-heuristic algorithms for other engineering optimization problems, which is the theoretical contribution of this study. The proposed approach reduces the total construction cost of the large-scale projects, which can be the practical benefit of this study.

Deep learning techniques are unavoidable in a variety of domains such as health care, computer vision, cyber-security and so on. These algorithms demand high data transfers but require bottlenecks in achieving the high speed and low latency synchronization while being implemented in the real hardware architectures. Though direct memory access controller (DMAC) has gained a brighter light of research for achieving bulk data transfers, existing direct memory access (DMA) systems continue to face the challenges of achieving high-speed communication. The purpose of this study is to develop an adaptive-configured DMA architecture for bulk data transfer with high throughput and less time-delayed computation.

The proposed methodology consists of a heterogeneous computing system integrated with specialized hardware and software. For the hardware, the authors propose an field programmable gate array (FPGA)-based DMAC, which transfers the data to the graphics processing unit (GPU) using PCI-Express. The workload characterization technique is designed using Python software and is implementable for the advanced risk machine Cortex architecture with a suitable communication interface. This module offloads the input streams of data to the FPGA and initiates the FPGA for the control flow of data to the GPU that can achieve efficient processing.

This paper presents an evaluation of a configurable workload-based DMA controller for collecting the data from the input devices and concurrently applying it to the GPU architecture, bypassing the hardware and software extraneous copies and bottlenecks via PCI Express. It also investigates the usage of adaptive DMA memory buffer allocation and workload characterization techniques. The proposed DMA architecture is compared with the other existing DMA architectures in which the performance of the proposed DMAC outperforms traditional DMA by achieving 96% throughput and 50% less latency synchronization.

The proposed gated recurrent unit has produced 95.6% accuracy in characterization of the workloads into heavy, medium and normal. The proposed model has outperformed the other algorithms and proves its strength for workload characterization.

The purpose of this article is to conduct a bibliometric analysis of the cellular manufacturing system (CMS) literature published from 1982–2021 to identify key issues and trends for the future.

A six-stage methodology is used to conduct a literature review, which includes: (1) article collection; (2) inclusion/exclusion criteria; (3) reviewing the articles; (4) analyzing the articles; (5) framework development; and (6) future research directions. A total of 936 CMS-specific articles are reviewed. This paper made use of three software tools: the R package, VOSviewer and SciMAT.

According to the findings, the majority of CM researchers focused on cell formation and design. The USA, Iran and India are the top three leading publishers. Additionally, the gap and future direction of CM are discussed.

To the best of the authors' knowledge, the current study is the first attempt to investigate CMS evaluation through bibliometric and thematic analysis and provides a decisional framework as well as steps for CMS adoption. For individuals who are interested in understanding more about CMS and its evolution, this paper offers a starting point.

The target of this research is to develop a mathematical model which combines the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and the Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP). Due to the importance of resource management, the proposed formulation comprises resource leveling considerations as well. The model aims to simultaneously optimize: (1) the total time to accomplish all projects and (2) the total deviation of resource consumptions from the uniform utilization levels.

The K-Means (KM) and Fuzzy C-Means (FCM) clustering methods have been separately applied to discover the clusters of activities which have the most similar resource demands. The discovered clusters are given to the scheduling process as priori knowledge. Consequently, the execution times of the activities with the most common resource requests will not overlap. The intricacy of the problem led us to incorporate the KM and FCM techniques into a meta-heuristic called the Bi-objective Symbiosis Organisms Search (BSOS) algorithm so that the real-life samples of this problem could be solved. Therefore, two clustering-based algorithms, namely, the BSOS-KM and BSOS-FCM have been developed.

Comparisons between the BSOS-KM, BSOS-FCM and the BSOS method without any clustering approach show that the clustering techniques could enhance the optimization process. Another hybrid clustering-based methodology called the NSGA-II-SPE has been added to the comparisons to evaluate the developed resource leveling framework.

The practical importance of the model and the clustering-based algorithms have been demonstrated in planning several construction projects, where multiple water supply systems are concurrently constructed.

Reviewing the literature revealed that there was a need for a hybrid formulation that embraces the characteristics of the RCMPSP and MSRCPSP with resource leveling considerations. Moreover, the application of clustering algorithms as resource leveling techniques was not studied sufficiently in the literature.

This study aims to investigate how to identify and address production levelling problems in assembly lines utilising an intensive manual workforce when higher productivity levels are urgently requested to meet market demands.

A mixed-methods approach was used in the research design, integrating case study analysis, interviews and qualitative/quantitative data collection and analysis. The methodology implemented also introduces to the literature on operational performance a novel combination of data analysis methods by introducing the use of the Natural Language Understanding (NLU) methods.

First, the findings unveil the impacts on operational performance that transportation, limited documentation and waiting times play in assembly lines composed of an intensive workforce. Second, the paper unveils the understanding of the role that a limited understanding of how the assembly line functions play in productivity. Finally, the authors provide actionable insights into the levelling problems in manual assembly lines.

This research supports industries operating assembly lines with intensive utilisation of manual workforce to improve operational performance. The paper also proposed a novel conceptual model prescriptively guiding quick and long-term improvements in intensive manual workforce assembly lines. The article assists industrial decision-makers with subsequent turnaround strategies to ensure higher efficiency levels requested by the market.

The paper offers actionable findings relevant to other manual assembly lines utilising an intensive workforce looking to improve operational performance. Some of the methods and strategies examined in this study to improve productivity require minimal capital investments. Lastly, the study contributes to the empirical literature by identifying production levelling problems in a real context.

In today's fast developing era, the volume of data is increasing day by day. The traditional methods are lagging for efficiently managing the huge amount of data. The adoption of machine learning techniques helps in efficient management of data and draws relevant patterns from that data. The main aim of this research paper is to provide brief information about the proposed adoption of machine learning techniques in different sectors of manufacturing supply chain.

This research paper has done rigorous systematic literature review of adoption of machine learning techniques in manufacturing supply chain from year 2015 to 2023. Out of 511 papers, 74 papers are shortlisted for detailed analysis.

The papers are subcategorised into 8 sections which helps in scrutinizing the work done in manufacturing supply chain. This paper helps in finding out the contribution of application of machine learning techniques in manufacturing field mostly in automotive sector.

The research is limited to papers published from year 2015 to year 2023. The limitation of the current research that book chapters, unpublished work, white papers and conference papers are not considered for study. Only English language articles and review papers are studied in brief. This study helps in adoption of machine learning techniques in manufacturing supply chain.

This study is one of the few studies which investigate machine learning techniques in manufacturing sector and supply chain through systematic literature survey.

1. A comprehensive understanding of Machine Learning techniques is presented.

2. The state of art of adoption of Machine Learning techniques are investigated.

3. The methodology of (SLR) is proposed.

4. An innovative study of Machine Learning techniques in manufacturing supply chain.

A comprehensive understanding of Machine Learning techniques is presented.

The state of art of adoption of Machine Learning techniques are investigated.

The methodology of (SLR) is proposed.

An innovative study of Machine Learning techniques in manufacturing supply chain.