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 123
- Downloads 0
Iot Based Raspberry Pi Home Automation System Using Amazon Dot
This project presents the design of the low cost home automation system using the IoT(Internet of Things) technology along with the feature of Amazon Dot. The Internet Of Things (IoT) is the most trending technology toda...
Digital Image Processing Assessment in Multi Slice CT Angiogram using Liner, Non-Liner and Both Classifiers
Nowadays with heart diseases most of peoples are dying lock process to find problem agile fashion in remote areas. In this research help to peoples who are staying remote also to find problem in heart on which location a...
CMV analysis of 5-level Cascaded H-Bridge MLI with equal and unequal DC sources using Variable Frequency SPWM Techniques
This paper, investigates the Common Mode Voltage (CMV)between neutral point of the star connected RL load and system ground.CMV also known as zero sequence voltage results in adverse effects like bearing currents, shaft...
Design and Analysis of an Excavator Bucket
An excavator is a run of the mill water driven substantial obligation human-worked machine utilized as a part of general adaptable development operations, for example, burrowing, ground leveling, conveying loads, dumping...
Prediction of Discharge in Straight Compound Channels using Conventional and Soft Computing Tools
Proper assessment of discharge capacity of a river is needed for design, operation and maintenance of channels. Estimation of stream flows in the compound open channel by numerical approach is very complex as it involves...