(3.230.143.40)
Users online: 1480    [ij] [ij] [ij] 
Email id
 

Research Journal of Engineering and Technology
Year : 2016, Volume : 7, Issue : 1
First page : ( 15) Last page : ( 18)
Print ISSN : 0976-2973. Online ISSN : 2321-581X.
Article DOI : 10.5958/2321-581X.2016.00004.0

Optimal Scheduling of N Job and N Machine by Branch and Bound Method: A Case Study Approach

Prof. Daf S. P.1,*, Prof. Anjikar A. D.1,**, Prof. Mohite G. R.1,***

1Asst. Prof., Mechanical Department, Priyadarshini Bhagawati College of Engineering, Nagpur

*Corresponding Author Email: shailu_daf@rediffmail.com

** akshayanjikar@gmail.com

*** grvmohite@gmail.com

Online published on 15 October, 2016.

Abstract

This paper deals with minimization of the total elapsed time for nx3 flow shop scheduling problem. A Branch and Bound technique is given to optimize the objective. The algorithm defined in this paper is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule. Our aim is to obtained optimal sequence of jobs and to minimize the total tardiness. The working of the algorithm has been illustrated by case study.

Top

Keywords

Flow shop scheduling, Processing time, Transportation time, Branch and Bound Technique, Optimal sequence.

Top

  
║ Site map ║ Privacy Policy ║ Copyright ║ Terms & Conditions ║ Page Rank Tool
486,038,892 visitor(s) since 30th May, 2005.
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.