A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighte...
A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness
About this item
Full title
Author / Creator
Publisher
Riga: Sciendo
Journal title
Language
English
Formats
Publication information
Publisher
Riga: Sciendo
Subjects
More information
Scope and Contents
Contents
A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal schedule whenever finding the exact solution is practically intractable. The three heuristics are base...
Alternative Titles
Full title
A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_31f8b9738ff54b8388455fe1e0ae908d
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_31f8b9738ff54b8388455fe1e0ae908d
Other Identifiers
ISSN
2255-8691,2255-8683
E-ISSN
2255-8691
DOI
10.2478/acss-2022-0001
