Branch and Bound Technique in Two Stage Flow Shop Scheduling Problem Including idle/waiting Time Operator Oi,w For a Job Block Where Jobs Are Performed in The Form of String
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 7
Abstract
This paper presents an algorithm with the help of branch and bound approach for a flowshop scheduling problems consisting of n jobs to be processed on 2 machines in which idle/waiting Time Operator Oi,w for a job block and all the jobs are performed in the form of string .the objective is to getthe optimal sequence of jobs to minimize the total elapsed time.
Authors and Affiliations
Deepak Gupta, , Harminder Singh , Sameer Sharma,
Keywords
Related Articles
- EP ID EP141348
- DOI -
- Views 46
- Downloads 0
Biometrics Security Technology with Speaker Recognition
—An improved methodology is presented for voice recognition in real action. This paper describes designing of voice recognition system in MATLAB environment. Voice is one of the unique qualities of every man kind....
Geographical Routing in Intermittently Connected MANETs with Guaranteed Delivery at Void Locations
The major challenges in MANETs are finding the destination, routing and robust communication dealing with constant topology change. When there is no end to end path at any given time between source and destination...
ition-based Opportunistic Routing for Highly Dynamic MANETSition-based Opportunistic Routing for Highly Dynamic MANETS
This paper solves the problem of delivering data packets for highly dynamic mobile ad hoc networks in a timely and reliable way. Already existing ad hoc routing protocols are susceptible to node mobilty.The issue is s...
Realizing Peer-to-Peer and Distributed Web Crawler
The tremendous growth of the World Wide Web has made tools such as search engines and information retrieval systems have become essential. In this dissertation, we propose a fully distributed, peer-to-peer architec...
MANET PROTOCOLS ANALYSIS WITH VARYING PAUSE TIME SIMULATION TIME AND SPEED
In this paper we are doing comparison of different routing protocols in MANET and these routing protocols are AODV, DSDV, and DSR [1]. The parameters on which the comparison is to be performed are speed, no. of pac...