Multiple-criteria assembly flowshop scheduling problem
MetadataShow full item record
CitationAl-Anzi, F. S. ve Allahverdi, A. (2009). Multiple-criteria assembly flowshop scheduling problem. Maltepe Üniversitesi. s. 162.
Different performance measures are considered in the scheduling research. These performance measures may be classified as completion time related or due date related. Makespan (Cmax), a completion time related performance measure, is one of the most widely used performance measures. Minimizing makespan is important in situations where a simultaneously received batch of jobs is required to be completed as soon as possible. For example, a multi-item order submitted by a single customer needs to be delivered as soon as possible. The makespan criterion also increases the utilization of resources. Minimizing maximum lateness (Lmax) is a widely used due date related measure. This objective is particularly important in situations where there is a penalty to complete a job beyond its due date and the penalty increases with the gap between the two. We consider a two-stage assembly flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and maximum lateness. The problem is known to be NP-hard, and therefore, we propose heuristics to solve the problem. The proposed heuristics are Tabu search (Tabu), particle swarm optimization (PSO), and self-adaptive differential evolution (SDE). An extensive computational experiment is conducted to compare the performance of the proposed heuristics. The computational experiment reveals that both PSO and SDE are much superior to Tabu. Moreover, it is statistically shown that PSO perform better than and SDE. The computation time of both PSO and SDE are close to each other and it is less than 45 seconds for the largest size problem considered.
SourceInternational Conference of Mathematical Sciences
- Makale Koleksiyonu 
The following license files are associated with this item: