Abstract
Parallel machine scheduling problems with common servers have many industrial applications. In this paper, we study a generalized problem of scheduling with a common server, which is the unrelated parallel machine scheduling problem with sequence-dependent setup times and machine eligibility restrictions. The objective function involves the minimization of the total weighted tardiness. A mixed integer linear programming (MILP) model is proposed to solve this complex problem. Due to the NP hardness of the problem, tabu search (TS) and simulated annealing (SA) algorithms are proposed. The initial solutions of the algorithms are obtained by a modified apparent tardiness cost with setups (ATCS) dispatching rule. The proposed algorithms are compared using a randomly generated data set.
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.
