Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4396949 / 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: 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: Q2743982 / rank | |||
Normal rank |
Revision as of 15:34, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion |
scientific article |
Statements
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (English)
0 references
25 August 2005
0 references
Sequencing
0 references
Robust optimization
0 references
Maximal regret
0 references
0 references