Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new metric, called Slack , to complement Critical Path and provide additional information to parallel pro...

The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

The permutation flowshop scheduling problem is a widely studied combinatorial optimization with several real-world applications. In this paper we address green variant of the controllable processing times and two objective functions: one related to service level factory (makespan) another total cost or energy/carbon consumption. For propose novel Critical-Path based Iterated Local Search. This ...

This paper presents a project-oriented framework for multi-robot task scheduling. An agent-based architecture is designed to schedule tasks where robots are considered as resources. The study focused on the problems when the number of available robots is less than the required number. In this case, the problem becomes a resource-constrained scheduling problem. Initially, tasks are scheduled by ...

The aim of this paper is to review a published paper, ‘Using computer software packages to enhance the teaching of Engineering Management Science: Part 1 –Critical path networks’. Excel in Microsoft Office 2007 was discovered to be able to solve critical path network problems with some programming. The capabilities of the two previously evaluated packages, Microsoft Project 2007 and Quantitativ...

T In this paper, we propose an approach based on hardware-software partitioning to minimize logic area of a SOPC circuit "System on a Programmable Chip". This approach minimizes the SOPC area while satisfying a time constraint. To minimize this area, we propose an algorithm to determine the critical path with the largest number of hardware tasks in a given data flow graph. Once these hardware t...

This project presents a high-throughput and ultralowpower asynchronous domino logic pipeline design method, targeting to latch-free and extremely fine-grain or gate-level design. The data paths are composed of a mixture of dual-rail and single-rail domino gates. Dual-rail domino gates are limited to construct a stable critical data path. Based on this critical data path, the handshake circuits ...

Time Schedule is a detailed division of work duration on each project work. The problem in this study the ineffectiveness and amount done not accordance with planned duration. purpose was to evaluate time schedule using network planning method determine critical trajectory by Microsoft Project 2016 software accelerate from its original acceleration adding labor, increasing working hours acceler...

A systematic procedure for locating resistive bridges is presented. Critical path tracing is used to identify a set of “suspect” bridges whose presence could explain all of the observed faulty behavior of the circuit for the original test set. The set of suspects is then reduced by adaptively applying additional tests derived from the failing vector pairs in the original test set. Unlike other ...