Research Journal of Engineering and Technology

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

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


Affiliations
1 Mechanical Department, Priyadarshini Bhagawati College of Engineering, Nagpur, India
     

   Subscribe/Renew Journal


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.

Keywords

Flow Shop Scheduling, Processing Time, Transportation Time, Branch and Bound Technique, Optimal Sequence.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 188

PDF Views: 1




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

Abstract Views: 188  |  PDF Views: 1

Authors

S. P. Daf
Mechanical Department, Priyadarshini Bhagawati College of Engineering, Nagpur, India
A. D. Anjikar
Mechanical Department, Priyadarshini Bhagawati College of Engineering, Nagpur, India
G. R. Mohite
Mechanical Department, Priyadarshini Bhagawati College of Engineering, Nagpur, India

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.

Keywords


Flow Shop Scheduling, Processing Time, Transportation Time, Branch and Bound Technique, Optimal Sequence.