Minimizing the Number of Tardy Jobs with Gammadistributed Processing Times

DOI

10.2991/icaise.2013.34How to use a DOI?

Keywords

Stochastic scheduling, single machine scheduling, flow shop scheduling, tardy jobs

Abstract

This paper investigates two scheduling problems i.e., single machine scheduling problem with minimizing the number of tardy jobs and two machine flow shop scheduling problem with a common due date and minimizing the number of tardy jobs, in a stochastic setting in the class of non-preemptive static list policies. It is assumed that the processing times of jobs are Gamma distributed stochastic variables. In previous results on these stochastic models, the strict condition– that all scale parameters are the same – is required. However, this condition may be difficult to be specified in real world problems. This paper presents new stochastic models for these two problems. Approximate deterministic problems are generated for these stochastic problems based on a new probability inequality, under mild conditions. The former stochastic models are special cases of our results.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Haohao Li
PY  - 2013/08
DA  - 2013/08
TI  - Minimizing the Number of Tardy Jobs with Gammadistributed Processing Times
BT  - Proceedings of the 2013 The International Conference on Artificial Intelligence and Software Engineering (ICAISE 2013)
PB  - Atlantis Press
SP  - 161
EP  - 165
SN  - 1951-6851
UR  - https://doi.org/10.2991/icaise.2013.34
DO  - 10.2991/icaise.2013.34
ID  - Li2013/08
ER  -