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

DOI10.1017/S0269964800002102zbMath1134.90403MaRDI QIDQ3416015

J. B. G. Frenk

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (4)

Group scheduling with learning effect and random processing time ⋮ Stochastic single machine scheduling with an exponentially distributed due date ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ On stochastic machine scheduling with general distributional assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Approximation with generalized hyperexponential distributions: Weak convergence results
• Assessing the effects of machine breakdowns in stochastic scheduling
• On the evaluation of fixed permutations as strategies in stochastic scheduling
• On stochastic scheduling problems with due dates
• Inequalities for stochastic flow shops and job shops
• On single-machine sequencing with order constraints
• On stochastic scheduling with precedence relations and switching costs
• On non-preemptive strategies for stochastic scheduling problems in continuous time
• On maximal sets of functions compatible with a partial ordering for distribution functions
• Stochastic scheduling with order constraints
• A dual algorithm for the one-machine scheduling problem

This page was built for publication: A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering