Traditional permutation flowshop scheduling problem (PFSP), which has unlimited buffer space, been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as aerospace industry and other sectors processing waste, have different blocking conditions due limited or lack of area between their machines. In this study, a mixture t...

Long term demand for freight movements in North America is expected to increase dramatically in the coming decades. The railroads are poised to take on this additional traffic assuming the capacity is available. Measuring the capacity of these rail lines is complicated by the interrelationships between asset utilization, reliability, and throughput. There is not a single metric that captures th...

Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop schedulin...

The system of linear equations obtained by finite difference discretization of the three-dimensional Poisson problem is solved by a matrix-free parallel implementation of the Jacobi method. After checking the convergence of our implementation, we compare the speed of using blocking MPI_Ssend/MPI_Recv and non-blocking MPI_Isend/MPI_Irecv communications. The comparisons indicate that the non-bloc...

We extend π-calculus with real-time by adding clocks, and give an operational semantics for it. We introduce timed bisimilarity and develop its properties, in particular, expansion theorem for realtime, concurrent, mobile processes. We present the outline of an implementation based on co-induction, coroutining, and constraint logic programming over reals of this operational semantics. We show h...

Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed Automata (PTA). We show how PTAs can be elegantly modeled via logic programming extended with coinduction and constraints over reals. We use this logic programming realization of a PTA to develop an elegant solution t...

In the United States, the freight railway industry is already running without much excess capacity. Hence, better planning and scheduling tools are needed to effectively manage the scarce resources, to cope with the rapidly increasing demand for railway transportation. The integration of freight train and passenger train scheduling and dispatching is an important railroad management task since ...

This paper examines the determinants of truck accidents in the United States using a time series data set covering the period 1970–2001. Along with other factors, the effect of the Motor Carrier Act of 1980, which deregulated the trucking industry, is examined for its impact on truck accidents. In addition, the model accounts for the effect railroad freight mileage has on truck accidents. Empir...

Much research has gone into using wireless sensor networks to monitor structural health by sensing and measuring vibrations. One problem here is that structural vibrations can be affected by many factors, which can make it difficult to determine the contribution of structural condition to measured vibrations. We propose a robust solution to this difficulty that consists of a wireless sensor net...