SCHEDULING USING DESIGN FLOWSHOP Particle Swarm Optimization to minimize Tardy NUMBER OF JOBS

SCHEDULING USING DESIGN FLOWSHOP Particle Swarm Optimization to minimize Tardy NUMBER OF JOBS
This paper propose an algorithm for general flowshop scheduling problems using Particle Swarm Optimization that can minimize the number of Tardy jobs. The algorithm is illustrated in a case study from the heavy equipment manufacturing industry. The proposed algorithm based on Particle Swarm Optimization algorithm developed by Tasgetiren routing using symbols, combined with the characteristic of its production. The jobs would be process in first work station using Particle Swarm Optimization approaches, for 2nd until 11th works station using a first come first served rules and earliest due date rules for the assembly's works station.
Keywords: scheduling, flowshop, particle swarm optimization, number of Tardy jobs
Scheduling is the process of decision-making role is very important in the manufacturing and service industries (Pinedo, 2002). Scheduling is the process of organizing, selection, and delivery time in the use of resources to carry out the activities required to produce the desired output (Morton and Pentico, 1993). Performance criteria such as the minimization of delay time and minimizing job completion (Baker, 1974).
Particle Swarm Optimization developed by Tasgetiren (2007) aims to provide a better makespan value. PSO is one of the optimization methods is better than the level of meta-heuristic methods. This research is the development of a study conducted by Tasgetiren (2007) the process of working on the production floor that exceeds the due date and the resulting delay in delivery of products. The expected performance criteria is minimizing the number of late jobs with the restriction that no job inserts. This paper was prepared covering introduction, literature review, methodology, case study examples, and a conclusion.

Full Thesis Contact me :)
Next Post »
0 Komentar

Terimakasih telah berkomentar