Minimizing the number of tardy jobs with stochastically-ordered processing times
type: Item
instance of: scholarly article
title: Minimizing the number of tardy jobs with stochastically-ordered processing times
zbMATH Open document ID: 1168.90490
author: Dan Trietsch
author: Kenneth R. Baker
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 5599838
zbMATH Keywords: sequencing
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: s10951-007-0022-z
OpenAlex ID: W2108353599
cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4367948
DOI: 10.1007/S10951-007-0022-Z
description: scientific article; zbMATH DE number 5599838