Minimizing the expected number of tardy jobs when processing times are normally distributed
type: Item
instance of: scholarly article
title: Minimizing the expected number of tardy jobs when processing times are normally distributed
zbMATH Open document ID: 1030.90043
DOI: 10.1016/S0167-6377(02)00110-4
author: Wooseung Jang
author: C. M. Klein
published in: Operations Research Letters
publication date: 2002-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1790734
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: heuristic
zbMATH Keywords: single machine scheduling
zbMATH Keywords: tardy jobs
zbMATH Keywords: dynamic policy
zbMATH Keywords: myopic approach
MaRDI profile type: Publication
cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
cites work: Bounds on optimal values in stochastic scheduling
cites work: Minimizing the expected weighted number of tardy jobs in stochastic flow shops
cites work: Q4354550
cites work: Rearrangement, Majorization and Stochastic Scheduling
cites work: On the minimization of the weighted number of tardy jobs with random processing times and deadline
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Q4142699
cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
cites work: Stochastic Scheduling with Release Dates and Due Dates
cites work: Q3525910
cites work: Sequencing jobs on a single machine with a common due data and stochastic processing times
cites work: The stochastic single machine scheduling problem with earliness and tardiness costs
full work available at URL: s0167-6377(02)00110-4
OpenAlex ID: W2043268737
description: scientific article; zbMATH DE number 1790734