Algorithms and complexity analysis for robust single-machine scheduling problems
type: Item
instance of: scholarly article
title: Algorithms and complexity analysis for robust single-machine scheduling problems
zbMATH Open document ID: 1333.90053
author: Bita Tadayon
author: J. Cole Smith
published in: Journal of Scheduling
publication date: 2016-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6534371
zbMATH Keywords: robust optimization
zbMATH Keywords: dynamic programming
zbMATH Keywords: integer programming
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10951-015-0418-0
OpenAlex ID: W1973245608
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Complexity of single machine scheduling problems under scenario-based uncertainty
cites work: Minmax regret solutions for minimax optimization problems with uncertainty
cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data
cites work: Q3182207
cites work: The Price of Robustness
cites work: Introduction to Stochastic Programming
cites work: Q3651735
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: A family of inequalities valid for the robust single machine scheduling polyhedron
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4309474
cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: Robust scheduling on a single machine to minimize total flow time
cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Deterministic network interdiction
cites work: On the robust single machine scheduling problem
DOI: 10.1007/S10951-015-0418-0
description: scientific article; zbMATH DE number 6534371