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

DOI10.1016/J.COR.2015.08.010zbMATH Open1349.90387OpenAlexW1445900351MaRDI QIDQ342174FDOQ342174

Jordi Pereira

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.08.010

zbMATH Keywords

uncertaintyrobust optimizationschedulingsingle machinebranch-and-bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• A Dynamic Programming Approach to Sequencing Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• Robust discrete optimization and its applications
• Scheduling
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• On the robust single machine scheduling problem
• Robust scheduling on a single machine to minimize total flow time
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Minmax regret solutions for minimax optimization problems with uncertainty
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• A mixed integer programming approach for the single machine problem with unequal release dates
• Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
• The robust set covering problem with interval data
• Minimizing total weighted completion time with uncertain data: a stability approach
• Exact and heuristic algorithms for the interval data robust assignment problem
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Minimizing earliness and tardiness costs in stochastic scheduling
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
• The minmax regret permutation flow-shop problem with two jobs
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution

Cited In (13)

• Target-oriented robust satisficing models for the single machine scheduling problems with release time
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Distributionally robust single machine scheduling with the total tardiness criterion
• Optimality region for job permutation in single-machine scheduling with uncertain processing times
• Single machine scheduling problem with interval processing times and total completion time objective
• The robust (minmax regret) assembly line worker assignment and balancing problem
• Research on the vehicle routing problem with interval demands
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
• Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
• Robust single machine scheduling with a flexible maintenance activity
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry

This page was built for publication: The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342174)