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: | |
---|---|
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 |