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 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:37, 5 March 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
