Minimizing the number of late jobs in a stochastic setting using a chance constraint
type: Item
instance of: scholarly article
title: Minimizing the number of late jobs in a stochastic setting using a chance constraint
zbMATH Open document ID: 1168.90484
author: Marjan Van Den Akker
author: Han Hoogeveen
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5599839
zbMATH Keywords: scheduling
zbMATH Keywords: sequencing
zbMATH Keywords: single machine
zbMATH Keywords: number of late jobs
zbMATH Keywords: stochastic processing times
zbMATH Keywords: Minimum success probability
zbMATH Keywords: Chance constraint
zbMATH Keywords: Dynamic programming
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: s10951-007-0034-8
OpenAlex ID: W2019293698
cites work: Q3951448
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
DOI: 10.1007/S10951-007-0034-8
description: scientific article; zbMATH DE number 5599839