Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study (Q5058841): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:46, 8 February 2024
scientific article; zbMATH DE number 7636671
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study |
scientific article; zbMATH DE number 7636671 |
Statements
Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study (English)
0 references
23 December 2022
0 references
discrete harmony search
0 references
scheduling and rescheduling
0 references
reprocessing
0 references
remanufacturing
0 references
