The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2015.08.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1445900351 / 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: Single machine scheduling problem with interval processing times to minimize mean weighted completion time / 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: The minmax regret permutation flow-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing earliness and tardiness costs in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer programming approach for the single machine problem with unequal release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: Exact and heuristic algorithms for the interval data robust assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust set covering problem with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted flow time of a set of jobs with interval processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted flow time under uncertainty using dominance and a stability box / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time with uncertain data: a stability approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust single machine scheduling problem / rank
 
Normal rank

Latest revision as of 23:57, 12 July 2024

scientific article
Language Label Description Also known as
English
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
scientific article

    Statements

    The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (English)
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    uncertainty
    0 references
    robust optimization
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references