A simulation approach is presented for planning and scheduling a flow of complex jobs for job shop like production systems. Machines may have their own specific restrictions and properties such as relative production speed, set up characteristics and scheduling rules. A production job consists of a set of tasks represented by a directed activity network in which an activity is defined as a sing...

The purpose of the paper was to address the timeliness of the signaller's intervention in the Ladbroke Grove rail incident in the UK, as well as to consider the utility of human performance time modelling more generally. Human performance response time modelling is a critical area for Human Factors and Ergonomics research. This research applied two approaches to the same problem to see if they ...

In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamic Critical Path Scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time ...

Recently, an approach using the discrete event paradigm for the simulation of continuous systems has been developed. This approach is based on the use of piecewise-linear approximations for the representation of continuous, time-varying quantities. The focus of this paper is to show how this new technique can be implemented on a multiprocessor. Our hypothesis is that the Time Warp algorithm is ...

Critical path method is a network based method planned for development and organization of complex project in real world application. In this paper, a new methodology has been made to find the critical path in a directed acyclic graph, whose activity time uncertain. The vague parameters in the network are represented by intuitionistic triangular fuzzy numbers, instead of crisp numbers. A new pr...

Figuring out why a process in a batch window ended late often requires tracing back through the critical path to look for anomalies. In a complicated batch schedule, determining which jobs are on the critical path can be a seemingly daunting task. Various commercial products can be used for this task, but they may not be necessary. The code needed to determine which predecessor jobs constitute ...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is co...

In this study a new approach to rank exponential fuzzy numbers using  -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using  -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers,  -cuts, Metric Dista...

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...