In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

The research investigates the term innovation and its role in elaborating architectural practice based on diffusion. The complexity of the architectural field compared with other fields shows a problem in explaining how innovations in architecture diffuse as a thought and act in a certain context of practice. Therefore, the research aims to build an intellectual model that explains the way personal thoughts resembled by unique models introduced by creative and innovator designers diffuse in a certain pattern elaborate these models into a state of prevailing thought resembled by the movement in architecture. The research will apply its model to the more comprehensive movement in architecture, which is the modern movement,

Transient mixed convection heat transfer in a confined porous medium heated at periodic sinusoidal heat flux is investigated numerically in the present paper. The Poisson-type pressure equation, resulted from the substituting of the momentum Darcy equation in the continuity equation, was discretized by using finite volume technique. The energy equation was solved by a fully implicit control volume-based finite difference formulation for the diffusion terms with the use of the quadratic upstream interpolation for convective kinetics scheme to discretize the convective terms and the temperature values at the control volume faces. The numerical study covers a range of the hydrostatic  pressure sinusoidal  amplitude  range and

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall

Transient mixed convection heat transfer in a confined porous medium heated at periodic sinusoidal heat flux is investigated numerically in the present paper. The Poisson-type pressure equation, resulted from the substituting of the momentum Darcy equation in the continuity equation, was discretized by using finite volume technique. The energy equation was solved by a fully implicit control volume-based finite difference formulation for the diffusion terms with the use of the quadratic upstream interpolation for convective kinetics scheme to discretize the convective terms and the temperature values at the control volume faces. The numerical study covers a range of the hydrostatic pressure head , , , , and ), sinusoidal amplitude range of

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

n this research, several estimators concerning the estimation are introduced. These estimators are closely related to the hazard function by using one of the nonparametric methods namely the kernel function for censored data type with varying bandwidth and kernel boundary. Two types of bandwidth are used: local bandwidth and global bandwidth. Moreover, four types of boundary kernel are used namely: Rectangle, Epanechnikov, Biquadratic and Triquadratic and the proposed function was employed with all kernel functions. Two different simulation techniques are also used for two experiments to compare these estimators. In most of the cases, the results have proved that the local bandwidth is the best for all the types of the kernel boundary func

يهدف البحث الى دراسة وتحليل الهندسة المتزامنة (CE) وتحسين التكلفة(CO)، واستعمال مخرجات الهندسة المتزامنة كمدخلات لتحسين التكلفة، وبيان دور الهندسة المتزامنة في تحسين جودة المنتوج، وتحقيق وفورات في وقت التصميم والتصنيع والتجميع وتخفيض التكاليف، فضلاً عن توظيف بعض النماذج لتحديد مقدار الوفورات في الوقت ومنها نموذج(Lexmark) ونموذج (Pert) لتحديد الوفورات في وقت التصميم وقت لتصنيع والتجميع.      ولتحقيق اهداف 

The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man