New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion
New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion
About this item
Full title
Author / Creator
Publisher
Sciendo
Journal title
Language
English
Formats
Publication information
Publisher
Sciendo
Subjects
More information
Scope and Contents
Contents
We consider an extension of Lagrangian relaxation methods for solving the total weighted tardiness scheduling problem on a single machine. First, we investigate a straightforward relaxation method and decompose it into upper and lower subproblems. For the upper subproblem we propose an alternative solving method in the form of a local search metahe...
Alternative Titles
Full title
New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_d9f7c79ffdfb416a8e4c8f8c0467b636
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_d9f7c79ffdfb416a8e4c8f8c0467b636
Other Identifiers
ISSN
1641-876X
E-ISSN
2083-8492
DOI
10.61822/amcs-2024-0017
