Abstract
For the serial-batching scheduling problem to minimize maximum lateness and makespan simultaneously, when the batch capacity b is unbounded, we have presented an O(n2)-time algorithm. In this paper, we concentrate on the corresponding bounded model of the bicriteria scheduling problem. We obtain an O(n6)-time algorithm to find all Pareto optimal solutions. Moreover, for the special case where the processing times and deadlines are agreeable, we present an O(n3)-time algorithm to find all Pareto optimal solutions. On the other hand, as a result of our main algorithm, we solve the open problem of minimizing maximum lateness on the single bounded serial-batching machine.
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.
