Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
From MaRDI portal
Publication:2434320
DOI10.1007/s10951-012-0306-9zbMath1280.90078OpenAlexW1964351171MaRDI QIDQ2434320
Yebin Zhang, Xianyi Wu, Xian Zhou
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0306-9
Inequalities; stochastic orderings (60E15) Stochastic scheduling theory in operations research (90B36) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Related Items
Risk measure of job shop scheduling with random machine breakdowns ⋮ Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect ⋮ Group scheduling with learning effect and random processing time ⋮ Single machine scheduling with stochastically dependent times ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ An uncertain parallel machine problem with deterioration and learning effect ⋮ Uncertain single-machine scheduling with deterioration and learning effect
Cites Work
- Unnamed Item
- Scheduling with general position-based learning curves
- Scheduling deteriorating jobs on a single machine subject to breakdowns
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Single-machine scheduling to stochastically minimize maximum lateness
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling with learning functions
- Single-machine scheduling with learning considerations
- A concise survey of scheduling with time-dependent processing times
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- Stochastic scheduling to minimize expected maximum lateness
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
- Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information
- Rearrangement, Majorization and Stochastic Scheduling
- Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria
- Scheduling stochastic jobs on a single machine subject to breakdowns
- On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
- STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME
- On the optimal allocation of service to impatient tasks
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Single-machine scheduling subject to stochastic breakdowns
- Scheduling
- Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine
- Scheduling problems with a learning effect
