A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
type: Item
instance of: scholarly article
title: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
zbMATH Open document ID: 1151.90417
author: Adam Kasperski
author: Paweł Zieliński
published in: Operations Research Letters
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5324086
zbMATH Keywords: scheduling
zbMATH Keywords: interval data
zbMATH Keywords: minmax regret
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.orl.2007.11.004
OpenAlex ID: W1983527457
cites work: Q4396949
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: Complexity of Scheduling under Precedence Constraints
cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
DOI: 10.1016/J.ORL.2007.11.004
description: scientific article; zbMATH DE number 5324086