Application of adaptive particle swarm optimization to bi-level job-shop scheduling problem
© 2014 KIIE. This study presents an application of adaptive particle swarm optimization (APSO) to solving the bi-level job-shop scheduling problem (JSP). The test problem presented here is 10×10 JSP (ten jobs and ten machines) with tri-bottleneck machines formulated as a bi-level formulation. APSO i...
Saved in:
Main Author: | Kasemset,C. |
---|---|
Format: | Article |
Published: |
2015
|
Online Access: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84923302863&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/39106 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
A PSO-based procedure for a bi-level multi-objective TOC-based job-shop scheduling problem
by: Kasemset,C., et al.
Published: (2015) -
HYBRID FIREFLY ALGORITHM DAN CAT SWARM
OPTIMIZATION PADA JOB SHOP SCHEDULING PROBLEM
by: CHYNTIA AJENG PUSPITASARI, 081211233025
Published: (2016) -
PENERAPAN HYBRID ALGORITMA CAT SWARM OPTIMIZATION
DAN SIMULATED ANNEALING UNTUK MASALAH
JOB SHOP SCHEDULING PROBLEM
by: MUTHIA SARI DEWI, 081211233022
Published: (2016) -
A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems
by: GAO, Kaizhou, et al.
Published: (2019) -
A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems
by: Gao Kaizhou, et al.
Published: (2020)