Minimization of total waiting time of jobs in n 2 specially structured Flow Shop Scheduling with set up time separated from processing time and each associated with probabilities
Journal Title: International Journal of engineering Research and Applications - Year 2017, Vol 7, Issue 6
Abstract
One of the most noteworthy issues in the setting up and function of programmed systems is scheduling but the creation of frequently admirable schedules has proven to be extremely complicated. In this paper an attempt is made to study specially structured n x2 flow shop scheduling in which set up time is detached from processing time both coupled by means of probabilities assuming that maximum of the equivalent processing time on first machine is less than or equal to the minimum of equivalent processing time on second machine. The problem conferred here is wider & basically more applicable and has noteworthy use when the goal is to minimize the total waiting time of jobs. The purpose of the study is to get most favorable progression of jobs in order to decrease the total waiting time of the jobs through iterative algorithm. The algorithm is made clear by numerical example. Keywords: Waiting time of jobs, Set up time, Flow shop Scheduling, Processing time.One of the most noteworthy issues in the setting up and function of programmed systems is scheduling but the creation of frequently admirable schedules has proven to be extremely complicated. In this paper an attempt is made to study specially structured n x2 flow shop scheduling in which set up time is detached from processing time both coupled by means of probabilities assuming that maximum of the equivalent processing time on first machine is less than or equal to the minimum of equivalent processing time on second machine. The problem conferred here is wider & basically more applicable and has noteworthy use when the goal is to minimize the total waiting time of jobs. The purpose of the study is to get most favorable progression of jobs in order to decrease the total waiting time of the jobs through iterative algorithm. The algorithm is made clear by numerical example.
Authors and Affiliations
Dr. Deepak Gupta, Bharat Goyal
Keywords
Related Articles
- EP ID EP391514
- DOI 10.9790/9622-0706072733.
- Views 110
- Downloads 0
Advanced Approach for Slopes Measurement by Non - Contact Optical Technique
A numerical computation of a very advanced experimental method to acquire shapes is introduced in this paper. The basic equations that relate the measurement of slopes to the basic geometric and optical parameters of the...
Dynamical Stress Analysis of Tectonic Earthquakes in Nusa Tenggara and its possible relations to the Activity of Mt. Rinjani, Indonesia
Some strong earthquakes are associated with increasing of volcanic activity in near and also in far field. This research is to investigate the effect of the tectonic earthquakes in Nusa Tenggara Island area towards the O...
The Impact of Lifestyle on Oral Health Status of Adolescents in Bhopal City, India
Purpose: To assess the impact of lifestyle on Oral health status of Adolescents in Bhopal City, India. Material and Methods: A convenience sample of 17-23 year old college going adolescents from one Arts institute in Bho...
Hedge Algebras Tuning of PID Controller
In this paper, the author proposes a method modified on-line the parameters of the PID controller based on combining the hedge algebras control and model reference system. This proposal has inherited the adaption of hedg...
A Study of Techniques on Securing Patient Confidiental Information by Using Ecg Steganography
Breaches and identity theft of medical data are on the rise. The advancement of electronic medical records has raised new concerns about privacy, balanced, duplication of services and medical errors. Modern issues includ...