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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
IEEE
2019-01-01
|
| Σειρά: | IEEE Access |
| Θέματα: | |
| Διαθέσιμο Online: | https://ieeexplore.ieee.org/document/8611081/ |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|