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

ASHA: AGENT BASED SECURE HOST ARP CACHE MANAGEMENT 

Host systems are exchange their IP-MAC pairs to establish communication. ARP (address resolution protocol) is maintains the IP-MAC pair of address of host in the cache table when the messages are receiving and send...

Security and QOS centric protocols for P2P networks: current state of the art

Peer-to-peer (p2p) networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A p2p network provides a scalable and fault-tolerant mechanism to locate...

An effective Golden Section Search Approach based Distribution Load Flow

Abstract—This paper presents an effective Golden Section Search approach based Distribution Load Flow (DLF) for planning of distributed generators as PQ and/or PV node. The practical distribution system may have diffe...

Human Identification Based Biometric Gait Features using MSRC Human Identification Based Biometric Gait Features using MSRC  

Human identification using gait is a new biometric intended to classify individuals by the way they walk have come to play an increasingly important role in visual surveillance applications. In gait biometric resea...

A STUDY ON OVERVIEW OF STEGANOGRAPHY WITH SPECIFIC TOOLS  

t -Steganography is a science for invisible communication and play vital role on the network security. The security process is manipulated with the different tools and technology. The technology is provided secured...

Download PDF file
  • EP ID EP151751
  • DOI -
  • Views 67
  • 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