Branch and Bound Technique To Two Stage Flow Shop Scheduling Problem In Which Setup Time is Separated From Processing Time And Both Are Associated With Probabilities 

Abstract

This paper presents an algorithm with the help of branch and bound approach for a flow shop scheduling problems consisting of n jobs to be processed on 2 machines in which setup time is separated from processing time and both are associated with probabilities. 

Authors and Affiliations

Deepak Gupta , Harminder Singh received

Keywords

Related Articles

Analysing Radio Wave Propagation Model for Indoor Wireless Communication 

for several wireless communication technologies, many propagation models have been presented in measuring path losses. In this paper, two propagation prediction models which relate signal strength log of distance...

Highly Secure Distributed Authentication and Intrusion Detection with DataFusion in MANET 

Continuous user-to-device authentication is a challenging task in high security mobile adhoc networks (MANETs). This paper provides distributed combined authentication and intrusion detection with data fusion in su...

Positioning of mobile station using Received signal strength and Time of arrival  

Positioning of users or Mobile Station (MS) in cellular systems becomes an interesting topic since the related number of applications for the location information is growing rapidly. Deploying such applications wou...

A Low-Quiescent Current Two- Input/Output Buffer with Class A-B Output Stage for LCD Driver 

the evolution of compact, light-weight, low-power, and high-quality displays has caused a large demand for liquid crystal display (LCD) drivers, with features such as low cost, low power dissipation, high speed, an...

Face Recognition Using Principal Component Analysis Method 

This paper mainly addresses the building of face recognition system by using Principal Component Analysis (PCA). PCA is a statistical approach used for reducing the number of variables in face recognition. In PCA...

Download PDF file
  • EP ID EP151751
  • DOI -
  • Views 80
  • Downloads 0

How To Cite

Deepak Gupta, Harminder Singh received (2012). Branch and Bound Technique To Two Stage Flow Shop Scheduling Problem In Which Setup Time is Separated From Processing Time And Both Are Associated With Probabilities . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 1(7), 141-143. https://europub.co.uk./articles/-A-151751