Minimizing worst-case and average-case makespan over scenarios
type: Item
instance of: scholarly article
title: Minimizing worst-case and average-case makespan over scenarios
zbMATH Open document ID: 1386.90052
author: E. Feuerstein
author: Alberto Marchetti-Spaccamela
author: Frans Schalekamp
author: L. Stougie
author: Anke van Zuylen
author: René A. Sitters
author: Suzanne Van der Ster
published in: Journal of Scheduling
publication date: 2018-02-28T00:00:00Z
full work available at URL: https://scholarworks.wm.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6845346
zbMATH Keywords: job scheduling
zbMATH Keywords: approximation algorithm
zbMATH Keywords: makespan
zbMATH Keywords: scenarios
describes a project that uses: Outward rotations
MaRDI profile type: Publication
OpenAlex ID: W2424274037
cites work: Q4258216
cites work: $(2+\varepsilon)$-Sat Is NP-hard
cites work: Robust optimization-methodology and applications
cites work: Introduction to Stochastic Programming
cites work: On Multidimensional Packing Problems
cites work: Q5351897
cites work: Universal sequencing on an unreliable machine
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
cites work: Some optimal inapproximability results
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Single machine scheduling problems with uncertain parameters and the OWA criterion
cites work: Parallel Machine Scheduling under Uncertainty
cites work: Approximating the min-max (regret) selecting items problem
cites work: On the power of unique 2-prover 1-round games
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Network design with a discrete set of traffic matrices
cites work: Scheduling
cites work: Improved approximations for max set splitting and max NAE SAT
cites work: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
DOI: 10.1007/S10951-016-0484-Y
description: scientific article; zbMATH DE number 6845346