A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering-Reference-Cited by-同舟云学术

A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

Published:1991-07 Issue:3 Volume:5 Page:297-315
ISSN:0269-9648
Container-title:Probability in the Engineering and Informational Sciences
language:en
Short-container-title:Prob. Eng. Inf. Sci.

Author:

frenk J. B. G.

Abstract

In this paper we present a general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering and review and extend some of the results for nonpreemptive permutation schedules recently obtained for these models.

Publisher

Cambridge University Press (CUP)

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability

Reference33 articles.

1. Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures

2. On maximal sets of functions compatible with a partial ordering for distribution functions

3. A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Single machine and group scheduling with random learning rates;AIMS Mathematics;2023

2. Group Scheduling with Learning Effect and Random Processing Time;Journal of Mathematics;2021-07-10

3. Scheduling;2012

4. Stochastic Single Machine Scheduling to Minimize the Weighted Number of Tardy Jobs;Advances in Intelligent and Soft Computing;2010

5. STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS;Probability in the Engineering and Informational Sciences;2006-09-19