Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
type: Item
instance of: scholarly article
title: Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
zbMATH Open document ID: 0998.90040
DOI: 10.1016/S0377-2217(98)00279-3
author: A. Hellmayr
author: Georg Ch. Pflug
author: Walter J. Gutjahr
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1829888
zbMATH Keywords: scheduling theory
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: single-machine tardiness problem
zbMATH Keywords: branch-and-bound
Wikidata QID: Q59255146
MaRDI profile type: Publication
cites work: Q3995531
cites work: Q3525910
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Simulated annealing for noisy cost functions
cites work: On optimal allocation of indivisibles under uncertainty
cites work: Stochastic programming approaches to stochastic scheduling
cites work: A heuristic for the single machine tardiness problem
cites work: Q3141922
cites work: Q3206104
cites work: Inequalities: theory of majorization and its applications
cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
cites work: A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
full work available at URL: s0377-2217(98)00279-3
OpenAlex ID: W2040309077
DBLP publication ID: journals/eor/GutjahrHP99
description: scientific article; zbMATH DE number 1829888