गंगा नदी क्षेत्र में भारी धातुओं की मात्रा का मापन व स्वर्णिम भविष्य

कृपया पूरा लेखा पढ

Threat Resistant Strategy Model Design & Analysis

Strategy of Business/ Operations remained crucial aspect in modern business environment as the ever changing scenario of business compels the design to be full proof to withstand the expected & unexpected  threats which may disrupt the well planned project. Designing such a strategy which not only withstand with the known threats but may also provide scope for the indicators to implement alternative / remedy looking at the existent /nonexistent symptoms. As in ever changing Business atmosphere the organizations are expected to transform their strategy as the suggested analysis of SWOT. & other prevalent age old technique /models practiced earlier are remained no more effective alone. Also the careful /effective analysis of the stakeholders, vendors/distributors, customers & government policies provide reason to be extra cautious for full proof strategy design in Cyber Era

Morphometric features of asterion in adult human skulls

Background: Asterion is the meeting point of temporal, occipital and parietal bones on the posterolateral surface of skull and surgically an important point of reference for approaching the posterior cranial fossa structures. However surgeons have been skeptical about its reliability due to population based differences in its morphology, distance with other external landmarks and also to sigmoid and transverse sinuses.Methods: In this study 50 (27 male & 23 female) adult skulls were investigated to determine the type of asterion, its distance from important bony landmarks and also the nearby venous sinuses were measured.Results: Our study revealed that type II (absence of sutural bones) was commoner than type I (presence of sutural bones) asterion. The asterion was 4.82 ± 0.58 cm from tip of the mastoid process on the right side and 4.70 ± 0.70 cm on the left. It was greater in males than in females, p value being statistically significant (P = 0.00 & P = 0.02 for right & left sides respectively). The distance of asterion from supramastoid crest was 4.22 ± 0.73 cm on the right and 4.23+/-0.58 cm on the left. The distance in males was more than in females. The P value 0.00 was statistically significant on the right side. Regarding the position of the asterion in relation to transverse sinus, it was on the transverse sinus in 62% cases, below it in 32% and above in 6%.Conclusions: The data obtained shows that the asterion is located either at the level or below the level of the transverse sinus in majority of the cases. This information is useful to neurosurgeons to reduce the risk during posterior cranial fossa surgeries. This work will also be useful to anthropologists, forensic science experts for determination of sex of the skull along with other parameters.

Bicriteria in n x 2 Flow Shop Scheduling Under Specified Rental Policy, Processing Time and Setup Time Each Associated with probabilities Including Job Block

This paper is an attempt to obtains an optimal solution for minimizing the bicriteria taken as minimizing thetotal rental cost of the machines subject to obtain the minimum makespan for n jobs 2 machines flowshopproblem in which the processing times and independent set up times are associated with probabilitiesincluding the job block concept. A heuristic approach method to find optimal or near optimal sequence hasbeen discussed. The proposed method is very simple and easy to understand and also provide an importanttool for the decision makers. A computer programme followed by a numerical illustration is give to clarifythe algorithm.Keywords: Flowshop Scheduling, Heuristic, Processing Time, Set Up Time, Rental Cost and Job Block

Constrained Flow Shop Scheduling with n-Jobs, 3-Machines, Processing Time Associated with Probability involving Transportation Time, Breakdown Interval and Weightage of Jobs

This paper is an attempt to find simple heuristic algorithm for n jobs, 3 machines flow shop scheduling problem in which processing times are associated with probabilities involving transportation time and break down interval. Further jobs are attached with weights to indicate their relative importance. A simple heuristic approach to find optimal or near optimal sequence minimizing the total elapsed time whenever mean weighted production flow time is taken into consideration. The proposed method is very easy to understand and, also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is also given to clarify the algorithm. Keywords: Flow shop scheduling, Processing time, Transportation time, Breakdown interval, Weights of job, Optimal sequenc

Bicriteria in n x 3 Flow Shop Scheduling under Specified Rental Policy, Processing Time Associated with Probabilities including Transportation Time and Job Block Criteria

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Transportation Time, Rental Cost, Idle Time, Job block, Makespa

On Linkage of a Flow Shop Scheduling Model Including Job Block Criteria with a Parallel Biserial Queue Network

This paper is an attempt to establish a linkage between a flowshop scheduling model having job block criteria with a parallel biserial queue network linked with a common channel in series. The arrival and service pattern both follows Poisson law in queue network. The generating function technique, law of calculus and statistical tools have been used to find out the various characteristics of queue. Further the completion time of jobs in a queue system form the set up time for the first machine in the scheduling model. A heuristic approach to find an optimal sequence of jobs with a job block criteria with minimum total flow time when the jobs are processed in a combined system with a queue network is discussed. The proposed method is easy to understand and also provide an important tool for the decision makers when the production is done in batches. A computer programme followed by a numerical illustration is given to justify the algorithm. Keywords: Queue Network, Mean Queue length, Waiting time, Processing time, Job-block, Makespan, Biserial Channe

Bicriteria in n x 3 Flow Shop Scheduling Under Specified Rental Policy, Processing Time Associated with Probabilities including Transportation Time and Job Block Criteria

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Transportation Time, Rental Cost, Idle Time, Job block, Makespa

Bicriteria in n x 2 Flow Shop Scheduling Problem under Specified Rental Policy, Processing Time, Setup Time Each Associated with Probabilities Including Job Block Criteria and Weightage of Jobs

This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as minimization of the total rental cost of the machines subject to obtain the minimum makespan for n-jobs, 2-machine flow shop scheduling problem in which the processing times and independent set up times are associated with probabilities including job block criteria. Further jobs are attached with weights to indicate their relative importance. The proposed method is very simple and easy to understand and also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is given to justify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Setup Time, Job Block, Weighs of job