 A stochastic scheduling approach to minimise the number of risky jobs and total probability of tardinessGokhan Egilmez, Aslican Arinsoy and Gürsel A. Süer International Journal of Services and Operations Management, 2018, vol. 30, issue 2, 186-202 Abstract: In this paper, single machine stochastic scheduling problem is addressed where jobs have probabilistic processing times and deterministic due dates. In classical scheduling literature, a job is called 'tardy' if it is completed after its due date; otherwise it's called 'early'. However, in probabilistic concept, a job can have a non-zero probability of tardiness. To capture this situation, a stochastic nonlinear mathematical model is developed. The objective is to minimise the expected number of tardy jobs and the total probability of tardiness. Experimentation is performed with datasets having varying number of jobs from 10 to 100. Results are compared with deterministic model. The proposed approach resulted in a significant decrease in the number of risky jobs and the total probability of tardiness. In addition, as the variance of processing times increased, the proposed stochastic approach provided safer schedules in terms of the total probability of tardiness. Keywords: stochastic scheduling; single machine; probability of tardiness; nonlinear optimisation; expected number of tardy jobs. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:30:y:2018:i:2:p:186-202 Access Statistics for this article More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.