N-Job, One Machine Sequencing Problems Under Uncertainty
From MaRDI portal
Publication:4060708
DOI10.1287/mnsc.20.1.101zbMath0304.90060OpenAlexW2010234539MaRDI QIDQ4060708
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
Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Deterministic network models in operations research (90B10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (5)
The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ General stochastic single-machine scheduling with regular cost functions ⋮ 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
This page was built for publication: N-Job, One Machine Sequencing Problems Under Uncertainty
