Minimizing the weighted sum of completion times under processing time uncertainty
type: Item
instance of: scholarly article
title: Minimizing the weighted sum of completion times under processing time uncertainty
zbMATH Open document ID: 1392.90059
author: Zacharie Ales
author: Thi Sang Nguyen
author: Michael Poss
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6858339
zbMATH Keywords: integer programming
zbMATH Keywords: robust optimization
zbMATH Keywords: scheduling
describes a project that uses: JuMP
MaRDI profile type: Publication
full work available at URL: j.endm.2018.01.003
OpenAlex ID: W2791420489
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Robust scheduling with budgeted uncertainty
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Robust combinatorial optimization with variable budgeted uncertainty
cites work: Robust combinatorial optimization with variable cost uncertainty
cites work: Algorithms and complexity analysis for robust single-machine scheduling problems
cites work: On the robust single machine scheduling problem
DOI: 10.1016/J.ENDM.2018.01.003
Recommended article: Minimizing the sum of weighted completion times with unrestricted weights
Recommended article: Minimizing total weighted completion time with uncertain data: a stability approach
Recommended article: Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability
Recommended article: Minimizing total weighted completion time with an unexpected machine unavailable interval
Recommended article: Minimizing the sum of weighted completion times in a concurrent open shop
Recommended article: Minimizing Weighted Completion Times with Deadlines
Recommended article: Minimizing total completion time for flowshop scheduling problem with uncertain processing times
Recommended article: A lower bound for weighted completion time variance
Recommended article: A note on minimizing total weighted completion time with an unexpected machine unavailable interval
Recommended article: Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
description: scientific article; zbMATH DE number 6858339