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 118
- Downloads 0
Collision Avoidance by Crack Detection in Railway Transportation System
In today’s world the Indian railways are the enormous rail passenger transport and it is the hardihood of the country transport infrastructure. One of the most widely used and comfortable mode of transportation system is...
Adaptive FANP And TOPSIS Method For Innovation Strategy Of Small Medium Enterprise (SME)
This study aims to determine the assessment and innovation strategy of SMEs based on the hybrid adaptive method of Fuzzy Analytic Network Process (FANP) and Technique for Order Preference by Similarity to Ideal Solution...
Successive Blind Interference Alignment Using Reconfigurable Antenna
Interference alignment is new interference mitigation technique. In latest studies many experiments evolutions are proved only for interference alignment. But very less have given attention to the blind interference alig...
Numerical Study on the Flow Length in an Injection Molding Process with an External Air-Heating Step
In this study, an external gas-assisted mold temperature control combined with water cooling was applied to achieve rapid mold-surface temperature control for observing the melt flow length in the thin-wall injection mol...
Role of Additives in Mortars: Historic Precedents
The use of lime in building construction began at least 10,000 years ago, where there are numerous evidence of its earlier uses. This research is an attempt to provide a review of the history of lime as a building materi...