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
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 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
GEOEYE
The Geoeye web services provide a new efficient solution to assemble the GIS functions into a variety of applications. This paper presents the system architecture design for web service based GIS. The GIS web servi...
A performance evaluation of various security assessments in WiMAX
One of the technologies that can lay the foundation for the next generation (fourth generation [4G]) of mobile broadband networks is popularly known as WiMAX. WiMAX stands for worldwide interoperability for microwave...
Wireless Sensor Networks for Disaster Management
World is a happening ground for the disasters almost daily. These incidents of mass destruction irrespective of the whether natural calamities or man-made catastrophes cause a huge loss of money, property and lives...
An Enhanced and efficient mechanism to detect Sybil attack in Wireless Sensor Networks
Wireless sensor networks are used for many different applications these days such as in environment applications, military applications, queue tracking, etc. In today’s scenario, security in WSN is one of the major iss...
DETECTION OF HEALTH CARE USING DATAMINING CONCEPTS THROUGH WEB
A major challenge facing healthcare organizations (hospitals, medical centers) is the provision of quality services at affordable costs. Quality service implies diagnosing patients correctly and administering treat...