Search results

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.

The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.

Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.

The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.

The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.

A real-time production scheduling method for semiconductor back-end manufacturing process becomes increasingly important in industry 4.0. Semiconductor back-end manufacturing process is always accompanied by order splitting and merging; besides, in each stage of the process, there are always multiple machine groups that have different production capabilities and capacities. This paper studies a multi-agent based scheduling architecture for the radio frequency identification (RFID)-enabled semiconductor back-end shopfloor, which integrates not only manufacturing resources but also human factors.

The architecture includes a task management (TM) agent, a staff instruction (SI) agent, a task scheduling (TS) agent, an information management center (IMC), machine group (MG) agent and a production monitoring (PM) agent. Then, based on the architecture, the authors developed a scheduling method consisting of capability & capacity planning and machine configuration modules in the TS agent.

The authors used greedy policy to assign each order to the appropriate machine groups based on the real-time utilization ration of each MG in the capability & capacity (C&C) planning module, and used a partial swarm optimization (PSO) algorithm to schedule each splitting job to the identified machine based on the C&C planning results. At last, we conducted a case study to demonstrate the proposed multi-agent based real-time production scheduling models and methods.

This paper proposes a multi-agent based real-time scheduling framework for semiconductor back-end industry. A C&C planning and a machine configuration algorithm are developed, respectively. The paper provides a feasible solution for semiconductor back-end manufacturing process to realize real-time scheduling.

This study develops a model and algorithm to solve the decentralized resource-constrained multi-project scheduling problem (DRCMPSP) and provides a suitable priority rule (PR) for coordinating global resource conflicts among multiple projects.

This study addresses the DRCMPSP, which respects the information privacy requirements of project agents; that is, there is no single manager centrally in charge of generating multi-project scheduling. Accordingly, a three-stage model was proposed for the decentralized management of multiple projects. To solve this model, a three-stage solution approach with a repeated negotiation mechanism was proposed.

The experimental results obtained using the Multi-Project Scheduling Problem LIBrary confirm that our approach outperforms existing methods, regardless of the average utilization factor (AUF). Comparative analysis revealed that delaying activities in the lower project makespan produces a lower average project delay. Furthermore, the new PR LMS performed better in problem subsets with AUF < 1 and large-scale subsets with AUF > 1.

A solution approach with a repeated-negotiation mechanism suitable for the DRCMPSP and a new PR for coordinating global resource allocation are proposed.

This paper aims to provide a comprehensive analysis of the state of the art in energy efficiency for autonomous mobile robots (AMRs), focusing on energy sources, consumption models, energy-efficient locomotion, hardware energy consumption, optimization in path planning and scheduling methods, and to suggest future research directions.

The systematic literature review (SLR) identified 244 papers for analysis. Research articles published from 2010 onwards were searched in databases including Google Scholar, ScienceDirect and Scopus using keywords and search criteria related to energy and power management in various robotic systems.

The review highlights the following key findings: batteries are the primary energy source for AMRs, with advances in battery management systems enhancing efficiency; hybrid models offer superior accuracy and robustness; locomotion contributes over 50% of a mobile robot’s total energy consumption, emphasizing the need for optimized control methods; factors such as the center of mass impact AMR energy consumption; path planning algorithms and scheduling methods are essential for energy optimization, with algorithm choice depending on specific requirements and constraints.

The review concentrates on wheeled robots, excluding walking ones. Future work should improve consumption models, explore optimization methods, examine artificial intelligence/machine learning roles and assess energy efficiency trade-offs.

This paper provides a comprehensive analysis of energy efficiency in AMRs, highlighting the key findings from the SLR and suggests future research directions for further advancements in this field.

Cloud computing (CC) refers to the usage of virtualization technology to share computing resources through the internet. Task scheduling (TS) is used to assign computational resources to requests that have a high volume of pending processing. CC relies on load balancing to ensure that resources like servers and virtual machines (VMs) running on real servers share the same amount of load. VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data.

VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. With a large number of VM or jobs, this method has a long makespan and is very difficult. A new idea to cloud loads without decreasing implementation time or resource consumption is therefore encouraged. Equilibrium optimization is used to cluster the VM into underloaded and overloaded VMs initially in this research. Underloading VMs is used to improve load balance and resource utilization in the second stage. The hybrid algorithm of BAT and the artificial bee colony (ABC) helps with TS using a multi-objective-based system. The VM manager performs VM migration decisions to provide load balance among physical machines (PMs). When a PM is overburdened and another PM is underburdened, the decision to migrate VMs is made based on the appropriate conditions. Balanced load and reduced energy usage in PMs are achieved in the former case. Manta ray foraging (MRF) is used to migrate VMs, and its decisions are based on a variety of factors.

The proposed approach provides the best possible scheduling for both VMs and PMs. To complete the task, improved whale optimization algorithm for Cloud TS has 42 s of completion time, enhanced multi-verse optimizer has 48 s, hybrid electro search with a genetic algorithm has 50 s, adaptive benefit factor-based symbiotic organisms search has 38 s and, finally, the proposed model has 30 s, which shows better performance of the proposed model.

User’s request or data transmission in a cloud data centre may cause the VMs to be under or overloaded with data. To identify the load on VM, initially EQ algorithm is used for clustering process. To figure out how well the proposed method works when the system is very busy by implementing hybrid algorithm called BAT–ABC. After the TS process, VM migration is occurred at the final stage, where optimal VM is identified by using MRF algorithm. The experimental analysis is carried out by using various metrics such as execution time, transmission time, makespan for various iterations, resource utilization and load fairness. With its system load, the metric gives load fairness. How load fairness is worked out depends on how long each task takes to do. It has been added that a cloud system may be able to achieve more load fairness if tasks take less time to finish.

In repetitive projects, repetition offers more possibilities for activity scheduling at the sub-activity level. However, existing resource-constrained repetitive scheduling problem (RCRSP) models assume that there is only one sequence in performing the sub-activities of each activity, resulting in an inefficient resource allocation. This paper proposes a novel repetitive scheduling model for solving RCRSP with soft logic.

In this paper, a constraint programming model is developed to solve the RCRSP using soft logic, aiming at the possible relationship between parallel execution, orderly execution or partial parallel and partial orderly execution of different sub activities of the same activity in repetitive projects. The proposed model integrated crew assignment strategies and allowed continuous or fragmented execution.

When solving RCRSP, it is necessary to take soft logic into account. If managers only consider the fixed logic between sub-activities, they are likely to develop a delayed schedule. The practicality and effectiveness of the model were verified by a housing project based on eight different scenarios. The results showed that the constraint programming model outperformed its equivalent mathematical model in terms of solving speed and solution quality.

Available studies assume a fixed logic between sub-activities of the same activity in repetitive projects. However, there is no fixed construction sequence between sub-activities for some projects, e.g. hotel renovation projects. Therefore, this paper considers the soft logic relationship between sub-activities and investigates how to make the objective optimal without violating the resource availability constraint.

The purpose of this study is to automatically generate a construction schedule by extracting data from the BIM (Building Information Modeling) model and combining an ontology constraint rule and a genetic algorithm (GA).

This study developed a feasible multi-phase framework to generate the construction schedule automatically through extracting information from the BIM, utilizing the ontology constraint rule to demonstrate the relationships between all the components and finally using the GA to generate the construction schedule.

To present the functionality of the framework, a prototype case is adopted to show the whole procedure, and the results show that the scheme designed in this study can quickly generate the schedule and ensure that it can satisfy the requirements of logical constraints and time parameter constraints.

A proper utilization of conceptual framework can contribute to the automatic generation of construction schedules and significantly reduce manual errors in the Architectural, Engineering, and Construction (AEC) industry. Moreover, a scheme of BIM-based ontology and GA for construction schedule generation may reduce additional manual work and improve schedule management performance.

The hybrid approach combines the ontology constraint rule and GA proposed in this study, and it is an effective attempt to generate the construction schedule, which provides a direct indicator for the schedule control of the project.

In this study, the data application process of the BIM model is divided into four modules: extraction, processing, optimization, and output. The key technologies including secondary development, ontology theory, and GA are introduced to develop a multi-phase framework for the automatic generation of the construction schedule and to realize the schedule prediction under logical constraints and duration interference.

The present work seeks to determine the optimal delivery schedule of equipment at a project site in the backdrop of limited storage space, at a minimum cost, and without disturbing the overall project schedule. In addition, the optimized delivery schedule helps in minimizing the fluctuating requirements of space at the project site across the entire project lifespan.

The study is carried out at a Steel plant operating in a constrained space but undergoing a production capacity expansion. The problem motivated us to explore the possibility of postponing the delivery dates of certain equipment closer to the erection dates without compromising on the project schedule. Given the versatility of linear programming models in dealing with such schedule optimization problems, the authors formulated the above problem as a Zero-One Integer Linear Programming problem.

The model is implemented for all the new equipment arriving for two major units – the Hot Strip Mill (HSM) and the Blast Furnace (BF). It generates an optimized delivery schedule by delaying the delivery of some equipment by a certain number of periods, without compromising the overall project schedule and at a minimum storage cost. The average space utilization increases by 25.85 and 14.79% in HSM and BF units respectively. The fluctuations in space requirements are reduced substantially in both units.

The study shows a timeline in the form of a Gantt chart for the delivery of equipment, storage of equipment across different periods, and the number of periods for which the delivery of certain equipment needs to be postponed. The study uses linearly increasing storage costs with the increase in the number of periods for storage of the equipment in the temporary shed.

1. Determined the optimal delivery schedule of the equipment in a project environment in the backdrop of limited storage space in the project site.

2. Formulated the above problem as a Zero-One Integer Linear Programming (ILP) problem.

3. The average space utilization has increased by 25.85 and 14.79% in HSM and BF units respectively.

4. The optimized delivery schedule helps in reducing the fluctuations in space requirements substantially across the entire lifespan of the project.

5. The timeline of delivery of equipment, storage of equipment across different periods and periods of postponement of the equipment are shown in the form of a Gantt Chart.

Determined the optimal delivery schedule of the equipment in a project environment in the backdrop of limited storage space in the project site.

Formulated the above problem as a Zero-One Integer Linear Programming (ILP) problem.

The average space utilization has increased by 25.85 and 14.79% in HSM and BF units respectively.

The optimized delivery schedule helps in reducing the fluctuations in space requirements substantially across the entire lifespan of the project.

The timeline of delivery of equipment, storage of equipment across different periods and periods of postponement of the equipment are shown in the form of a Gantt Chart.

The purpose of this paper is to develop a building information modelling (BIM)-based multi-objective optimization (MOO) framework for volumetric analysis of buildings during early design stages. The objective is to optimize volumetric spaces (3D) instead of 2D spaces to enhance space utilization, thermal comfort, constructability and rental value of buildings

The integration of two fundamental concepts – BIM and MOO, forms the basis of proposed framework. In the early design phases of a project, BIM is used to generate precise building volume data. The non-sorting genetic algorithm-II, a MOO algorithm, is then used to optimize extracted volume data from 3D BIM models, considering four objectives: space utilization, thermal comfort, rental value and construction cost. The framework is implemented in context of a school of architecture building project.

The findings of case study demonstrate significant improvements resulting from MOO of building volumes. Space utilization increased by 30%, while thermal comfort improved by 20%, and construction costs were reduced by 10%. Furthermore, rental value of the case study building increased by 33%.

The proposed framework offers practical implications by enabling project teams to generate optimal building floor layouts during early design stages, thereby avoiding late costly changes during construction phase of project.

The integration of BIM and MOO in this study provides a unique approach to optimize building volumes considering multiple factors during early design stages of a project