A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NLPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OPERA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TOMLAB / 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/s11590-013-0655-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074479192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / 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: Transmission Network Expansion Planning Under Deliberate Outages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Executing production schedules in the face of uncertainties: a review and some future directions / 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: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / 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: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty / 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with uncertain numerical data for makespan minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean flow time minimization with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal makespan scheduling with given bounds of processing times / 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 multi-market newsvendor models with interval demand data / 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: Scheduling with uncertainties on new computing platforms / 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: Strategic facility location: A review / 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: A decomposition scheme for single stage scheduling problems / 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: On the robust single machine scheduling problem / rank
 
Normal rank

Latest revision as of 10:54, 8 July 2024

scientific article
Language Label Description Also known as
English
A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
scientific article

    Statements

    A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (English)
    0 references
    0 references
    30 April 2014
    0 references
    minmax-regret models
    0 references
    robustness and sensitivity analysis
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers