The Discrete Particle Swarm Optimization Algorithms For Permutation Flowshop Scheduling Problem
In this paper, two types of discrete particle swarm optimization (DPSO) algorithms are presented to solve the Permutation Flow Shop Scheduling Problem (PFSP). We used criteria to minimize total earliness and total tardiness. The main contribution of this study is a new position update method is deve...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Jurusan Teknik Industri, Fakultas Teknik Universitas Muhammadiyah Malang
2019-08-01
|
| Series: | Jurnal Teknik Industri |
| Subjects: | |
| Online Access: | http://ejournal.umm.ac.id/index.php/industri/article/view/7986 |