Bi-Population Based Discrete Bat Algorithm for the Low-Carbon Job Shop Scheduling Problem
Job shop scheduling problem (JSP) is a combinatorial optimization problem, which has been widely studied due to its strong theoretical and background for application. However, in previous studies on the traditional JSP, the optimization objective is mainly relative to time, such as makespan, flow ti...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
IEEE
2019-01-01
|
| Seri Bilgileri: | IEEE Access |
| Konular: | |
| Online Erişim: | https://ieeexplore.ieee.org/document/8611081/ |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|