Abstract
The paper studies simultaneous minimization of makespan of agent A and the maximum cost of agent B on a bounded series-batch machine, in which different agents’ jobs cannot be scheduled in the same batch and each agent’s objection function is only related to the completion times of his own jobs. In the paper, we present an algorithm that can obtain all Pareto optimal schedules of our problem in O ( n A + n B 5 ) time.
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 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.
