Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study (Q5058841)

From MaRDI portal
Revision as of 19:37, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 December 2022
    0 references
    0 references
    discrete harmony search
    0 references
    scheduling and rescheduling
    0 references
    reprocessing
    0 references
    remanufacturing
    0 references