Abstract
This paper considers a flowshop scheduling problem with two criteria, where the primary (dominant) criterion is the minimization of material waste and the secondary criterion is the minimization of the total tardiness time. The decision maker does not authorize trade-offs between the criteria. In view of the nature of this problem, a hierarchical (lexicographical) optimization approach is followed. An effective greedy heuristic is proposed to minimize the material waste and a simulated annealing (SA) algorithm is developed to minimize the total tardiness time, subjective to the constraint computed for the primary criterion. The solution accuracy is compared with the optimal solution obtained by complete enumeration for randomly generated problem sets. From the results, it is observed that the greedy heuristic produces the optimal solution and the SA solution does not differ significantly from the optimal solution.
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: The International Journal of Advanced Manufacturing Technology
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.
