A polynomial time algorithm for a chance-constrained single machine scheduling problem
type: Item
instance of: scholarly article
title: A polynomial time algorithm for a chance-constrained single machine scheduling problem
zbMATH Open document ID: 0506.90039
DOI: 10.1016/0167-6377(83)90038-X
author: Toshihide Ibaraki
author: Naoki Katoh
published in: Operations Research Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3799383
zbMATH Keywords: chance-constrained sequencing problem
zbMATH Keywords: single machine
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
cites work: Stochastic spanning tree problem
cites work: An Algorithm for the Equipollent Resource Allocation Problem
cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
cites work: AN EFFICIENT ALGORITHM FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEM
full work available at URL: 0167-6377(83)90038-x
OpenAlex ID: W2032618916
description: scientific article; zbMATH DE number 3799383