All Title Author
Keywords Abstract

Solving Flow-shop Sequencing Problem using Scheduling Algorithm based on Search and Prune Technique

Keywords: machines , generalization

Full-Text   Cite this paper   Add to My Lib


In sequencing problems, there are one or more jobs to be done and one or more machines are available for this purpose. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Flexible flow shops are thus generalization of simple flow shops. In this paper, we are solving flexible flow shop sequencing problem of two machine centers, using an algorithm. The proposed algorithm will be suitable for a medium-sized number of jobs; it is an optimal algorithm, entirely using the search-and-prune technique


comments powered by Disqus

Contact Us


微信:OALib Journal