Blocks for two-machines total weighted tardiness flow shop scheduling problem
Blocks for two-machines total weighted tardiness flow shop scheduling problem
About this item
Full title
Author / Creator
Bożejko, W , Uchroński, M and Wodecki, M
Publisher
Warsaw: Polish Academy of Sciences
Journal title
Language
English
Formats
Publication information
Publisher
Warsaw: Polish Academy of Sciences
Subjects
More information
Scope and Contents
Contents
The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving th...
Alternative Titles
Full title
Blocks for two-machines total weighted tardiness flow shop scheduling problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_a9c9a58618414c67b38989d2ef8f1e26
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_a9c9a58618414c67b38989d2ef8f1e26
Other Identifiers
ISSN
0239-7528
E-ISSN
2300-1917
DOI
10.24425/bpasts.2020.131829
