Multi-Objective Optimization;
Single Machine Scheduling;
Weighted Tardiness;
Sequence-Dependent;
Setup Times and Setup Costs;
Pareto Optimal;
Total Weighted Tardiness and Setup Costs Scheduling;
PARTICLE SWARM OPTIMIZATION;
TOTAL WEIGHTED TARDINESS;
SCHEDULING ALGORITHM;
COMPREHENSIVE SURVEY;
D O I:
10.7232/iems.2019.18.4.735
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
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.