Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-015-0418-0 / 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.1007/s10951-015-0418-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973245608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine scheduling problems under scenario-based uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of inequalities valid for the robust single machine scheduling polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust scheduling on a single machine to minimize total flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust single machine scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-015-0418-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:05, 10 December 2024

scientific article
Language Label Description Also known as
English
Algorithms and complexity analysis for robust single-machine scheduling problems
scientific article

    Statements

    Algorithms and complexity analysis for robust single-machine scheduling problems (English)
    0 references
    0 references
    0 references
    22 January 2016
    0 references
    robust optimization
    0 references
    dynamic programming
    0 references
    integer programming
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references