Abstract
This paper pertain to a specially structured n- jobs, 3- machines flow shop scheduling in which the processing times are associated with probabilities to minimize the rental cost of the machines. Further the expected processing times are not random but bear a well defined relationship to one another. Many heuristics approaches have already been discussed in literature to minimize the makespan. But, in many cases minimization of makespan does not lead to minimum rental cost of the machines under a specified rental policy. The present work is an attempt to develop a heuristic algorithm to minimize the rental cost of the machines under a specified rental policy and will provide an important tool for the decision makers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Physics and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
