N-Job, One Machine Sequencing Problems Under Uncertainty

DOI10.1287/MNSC.20.1.101MaRDI QIDQ4060708zbMATH OpenOpenAlexFDO

Authors Roger A. Blau

Publication date 1973

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.20.1.101

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cited in

(5)

• On the evaluation of fixed permutations as strategies in stochastic scheduling
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Job selection and sequencing on a single machine in a random environment
• The stochastic single machine scheduling problem with earliness and tardiness costs
• General stochastic single-machine scheduling with regular cost functions

This page was built for publication: N-Job, One Machine Sequencing Problems Under Uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060708)