Abstract
Scheduling with multiple agents has become a popular topic in recent years. However, most of the research focused on problems with two competing agents. In this article, we consider a single-machine scheduling problem with three agents. The objective is to minimize the total weighted completion time of jobs from the first agent given that the maximum completion time of jobs from the second agent does not exceed an upper bound and the maintenance activity from the third agent must be performed within a specified period of time. A lower bound based on job division and several propositions are developed for the branch-and-bound algorithm, and a genetic algorithm with a local search is constructed to obtain near-optimal solutions. In addition, computational experiments are conducted to test the performance of the algorithms.
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.
