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  

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

A Comparative Study On Some New Steganographic Techniques 

In this paper, we present some new methods and develop techniques with algorithms for hiding text behind the gray scale image. Steganographic technique allows the sender to communicate information to the receiver w...

Cloud Computing Data Storage and Security Enhancement  

Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources. Cloud computing provides computation, software, data access, and storage services t...

GA optimized SVD based signal detector for Cognitive radio Networks 

This paper examines the implementation of the Genetic Algorithm (GA) optimized Singular Value Decomposition (SVD) method to detect the presence of wireless signal. We simulated the algorithm using common digital...

A Survey of Different Software Fault Prediction Using Data Mining Techniques Methods 

Software fault prediction method used to improve the quality of software. Defective module leads to decrease the customer satisfaction and improve cost. Software fault prediction technique implies a good investment...

Performance Enhancement of CPU Scheduling by Hybrid Algorithms Using Genetic Approach  

Scheduling is a fundamental operating-system function. The concept is to have computer resources shared by a number of processes. The productivity of a computer solely depends on the use of CPU scheduling algorithm...

Download PDF file
  • EP ID EP141348
  • DOI -
  • Views 68
  • Downloads 0

How To Cite

Deepak Gupta, , Harminder Singh, Sameer Sharma, (2012). 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  . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 1(7), 137-140. https://europub.co.uk/articles/-A-141348