Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns

Authors:
Yebin Zhang;Xianyi Wu;Xian Zhou
Affiliations:
Department of Mathematics, Jiangxi Normal University, Nanchang, China;Department of Statistics and Actuarial Science, East China Normal University, Shanghai, China and Department of Applied Finance and Actuarial Studies Macquarie University, Sydney, Australia;Department of Applied Finance and Actuarial Studies Macquarie University, Sydney, Australia
Venue:
Journal of Scheduling
Year:
2013

Citing 12
Cited 0

Rearrangement, majorization and stochastic scheduling

Mathematics of Operations Research
Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

Operations Research
STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME

Probability in the Engineering and Informational Sciences
Single-machine scheduling to stochastically minimize maximum lateness

Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Some scheduling problems with general position-dependent and time-dependent learning effects

Information Sciences: an International Journal
Single-machine and flowshop scheduling with a general learning effect model

Computers and Industrial Engineering
Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information

Operations Research
Some single-machine scheduling problems with a truncation learning effect

Computers and Industrial Engineering
Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects"

Information Sciences: an International Journal
Scheduling deteriorating jobs on a single machine subject to breakdowns

Journal of Scheduling
Scheduling with general position-based learning curves

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The focus of this study is to analyze position-based learning effects in single-machine stochastic scheduling problems. The optimal permutation policies for the stochastic scheduling problems with and without machine breakdowns are examined, where the performance measures are the expectation and variance of the makespan, the expected total completion time, the expected total weighted completion time, the expected weighted sum of the discounted completion times, the maximum lateness and the maximum tardiness.