|
|
|
|
Two Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method
|
|
|
|
|
|
|
|
نویسنده
|
Gupta D. ,Bala Sh ,Singla P
|
|
منبع
|
international journal of applied operational research - 2013 - دوره : 3 - شماره : 4 - صفحه:1 -6
|
|
چکیده
|
Abstract this paper presents an algorithm with the help of branch and bound approach for the two stage flow shop scheduling problem including transportation time and weightage of jobs; processing times are associated with their respective probabilities. our main objective is to find the optimal/ near optimal sequence of jobs in order to minimize the total elapsed time. an algorithm is clarified with the help of a numerical example.
|
|
کلیدواژه
|
Flow Shop Scheduling ,Branch and Bound Method ,Elapsed Time ,Transportation Time ,Weightage of Jobs
|
|
آدرس
|
Prof. & Head, Department of Mathematics, Maharishi, India, Prof. & Head, Department of Mathematics, Maharishi, india, Prof. & Head, Department of Mathematics, Maharishi, india
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|