Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Distributionally robust single machine scheduling with the total tardiness criterion

scientific article; zbMATH DE number 6988092

Language	Label	Description	Also known as
default for all languages	No label defined
English	Distributionally robust single machine scheduling with the total tardiness criterion	scientific article; zbMATH DE number 6988092

Statements

instance of

scholarly article

0 references

title

Distributionally robust single machine scheduling with the total tardiness criterion (English)

0 references

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

3 December 2018

0 references

zbMATH Keywords

single machine scheduling

0 references

distributionally robust optimization

0 references

total tardiness

0 references

branch-and-bound

0 references

beam search

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2018.08.007

0 references

cites work

Complexity of single machine scheduling problems under scenario-based uncertainty

0 references

Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

0 references

Q3151174

0 references

Introduction to stochastic programming.

0 references

A branch and bound algorithm for the job-shop scheduling problem

0 references

Distributionally robust single machine scheduling with risk aversion

0 references

Tight bounds for some risk measures, with applications to robust portfolio selection

0 references

A new decomposition approach for the single machine total tardiness scheduling problem

0 references

Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

0 references

A family of inequalities valid for the robust single machine scheduling polyhedron

0 references

A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem

0 references

Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints

0 references

Stochastic single machine scheduling with an exponentially distributed due date

0 references

Q4312982

0 references

New Precedence Theorems for One-Machine Weighted Tardiness

0 references

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

0 references

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

0 references

A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties

0 references

A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine

0 references

A faster fully polynomial approximation scheme for the single-machine total tardiness problem

0 references

Q4124332

0 references

Complexity of minimizing the total flow time with interval data and minmax regret criterion

0 references

Robust scheduling on a single machine to minimize total flow time

0 references

Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem

0 references

A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data

0 references

An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems

0 references

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

0 references

Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

0 references

On duality theory of conic linear problems.

0 references

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

0 references

The stochastic single machine scheduling problem with earliness and tardiness costs

0 references

A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times

0 references

Algorithmic paradoxes of the single-machine total tardiness problem

0 references

Algorithms and complexity analysis for robust single-machine scheduling problems

0 references

Minimizing the number of tardy jobs with stochastically-ordered processing times

0 references

Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation

0 references

On the robust single machine scheduling problem

0 references

Identifiers

zbMATH Open document ID

1458.90339

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.COR.2018.08.007

0 references

Sitelinks

Mathematics(1 entry)

mardi Distributionally robust single machine scheduling with the total tardiness criterion