A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6767936
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1023/B:ANOR.0000030680.29037.d0 / rank
Normal rank
 
Property / author
 
Property / author: Éric Pinson / rank
Normal rank
 
Property / author
 
Property / author: Éric Pinson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/b:anor.0000030680.29037.d0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060676778 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1023/B:ANOR.0000030680.29037.D0 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / Recommended article: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / qualifier
 
Similarity Score: 0.95100003
Amount0.95100003
Unit1
Property / Recommended article: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3640879 / rank
 
Normal rank
Property / Recommended article: Q3640879 / qualifier
 
Similarity Score: 0.9327115
Amount0.9327115
Unit1
Property / Recommended article: Q3640879 / qualifier
 
Property / Recommended article
 
Property / Recommended article: A branch and bound procedure to minimize mean absolute lateness on a single processor / rank
 
Normal rank
Property / Recommended article: A branch and bound procedure to minimize mean absolute lateness on a single processor / qualifier
 
Similarity Score: 0.9304891
Amount0.9304891
Unit1
Property / Recommended article: A branch and bound procedure to minimize mean absolute lateness on a single processor / qualifier
 
Property / Recommended article
 
Property / Recommended article: A new branch and bound algorithm for minimizing the weighted number of tardy jobs / rank
 
Normal rank
Property / Recommended article: A new branch and bound algorithm for minimizing the weighted number of tardy jobs / qualifier
 
Similarity Score: 0.92847097
Amount0.92847097
Unit1
Property / Recommended article: A new branch and bound algorithm for minimizing the weighted number of tardy jobs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4025613 / rank
 
Normal rank
Property / Recommended article: Q4025613 / qualifier
 
Similarity Score: 0.92688954
Amount0.92688954
Unit1
Property / Recommended article: Q4025613 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Approximation algorithms for minimizing the total weighted tardiness on a single machine / rank
 
Normal rank
Property / Recommended article: Approximation algorithms for minimizing the total weighted tardiness on a single machine / qualifier
 
Similarity Score: 0.9237168
Amount0.9237168
Unit1
Property / Recommended article: Approximation algorithms for minimizing the total weighted tardiness on a single machine / qualifier
 
Property / Recommended article
 
Property / Recommended article: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions / rank
 
Normal rank
Property / Recommended article: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions / qualifier
 
Similarity Score: 0.9236297
Amount0.9236297
Unit1
Property / Recommended article: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions / qualifier
 
Property / Recommended article
 
Property / Recommended article: A branch and bound algorithm for minimizing weighted completion times with deadlines / rank
 
Normal rank
Property / Recommended article: A branch and bound algorithm for minimizing weighted completion times with deadlines / qualifier
 
Similarity Score: 0.9146486
Amount0.9146486
Unit1
Property / Recommended article: A branch and bound algorithm for minimizing weighted completion times with deadlines / qualifier
 
Property / Recommended article
 
Property / Recommended article: A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine / rank
 
Normal rank
Property / Recommended article: A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine / qualifier
 
Similarity Score: 0.9101522
Amount0.9101522
Unit1
Property / Recommended article: A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine / qualifier
 
Property / Recommended article
 
Property / Recommended article: STACS 2004 / rank
 
Normal rank
Property / Recommended article: STACS 2004 / qualifier
 
Similarity Score: 0.9064954
Amount0.9064954
Unit1
Property / Recommended article: STACS 2004 / qualifier
 

Latest revision as of 19:37, 4 April 2025

scientific article
Language Label Description Also known as
English
A branch and bound algorithm to minimize total weighted tardiness on a single processor
scientific article

    Statements

    A branch and bound algorithm to minimize total weighted tardiness on a single processor (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    scheduling
    0 references
    Lagrangian decomposition
    0 references
    branch and bound
    0 references

    Identifiers