Abstract
This paper considers the problem of generating a set of efficient (non-dominated) schedules on identical parallel machines involving total flow-time and total number of tardy jobs. In view of the NP-hard nature of this problem, heuristic algorithms are proposed for its solution. Two evaluation methods that provide a scheme by which multiple non-dominated sets can be compared are described and used to compare the performance of the proposed algorithms. Results of several experiments demonstrate the capability of the proposed algorithms and evaluation methodologies to address the problem at hand.
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 callDisclaimer: 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.
