Abstract
A single machine scheduling problem with sequence-dependent setup times and setup costs has a critical role in manufacturing and service sectors to minimize orders delays and costs. This study provides multiple objectives model to solve the single machine total weighted tardiness and setup costs scheduling problem associated with sequence-dependent setup times and sequence-dependent setup costs (MOSTWTSCSD). The objectives are to minimize the total weighted tardiness and the total setup costs for all jobs without any certain relationship between the setup time and the setup cost, as happened in some machines. An alternative heuristic procedure based on discrete particle swarm optimization (DPSO) is suggested to find representative Pareto front (non-dominated) solutions. Many efficient methods have been used inside the DPSO to improve its performance. Results show that the ability of the suggested solution approach to provide a representative Pareto fronts in reasonable computational efforts compared with another heuristic.
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.
