2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MOD-DIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MENU-OKF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2022.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4308738222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the robust 1-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust single machine makespan scheduling with release date uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3511520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust absolute single machine makespan scheduling-location problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank

Latest revision as of 03:12, 31 July 2024

scientific article
Language Label Description Also known as
English
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
scientific article

    Statements

    2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (English)
    0 references
    0 references
    0 references
    12 December 2022
    0 references
    0 references
    scheduling-location
    0 references
    approximation algorithms
    0 references
    uncertainty
    0 references
    robust optimization
    0 references
    lateness
    0 references
    0 references
    0 references
    0 references
    0 references