Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2018.08.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885693251 / 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: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributionally robust single machine scheduling with risk aversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decomposition approach for the single machine total tardiness scheduling problem / 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: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / 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: A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic single machine scheduling with an exponentially distributed due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Precedence Theorems for One-Machine Weighted Tardiness / 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: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster fully polynomial approximation scheme for the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / 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: Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem / 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 Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic single machine scheduling problem with earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity analysis for robust single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of tardy jobs with stochastically-ordered processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust single machine scheduling problem / rank
 
Normal rank

Latest revision as of 13:06, 17 July 2024

scientific article
Language Label Description Also known as
English
Distributionally robust single machine scheduling with the total tardiness criterion
scientific article

    Statements

    Distributionally robust single machine scheduling with the total tardiness criterion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 December 2018
    0 references
    single machine scheduling
    0 references
    distributionally robust optimization
    0 references
    total tardiness
    0 references
    branch-and-bound
    0 references
    beam search
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers