Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models

This paper studies the single machine scheduling problem for the objective of minimizing the expected number of tardy jobs. Jobs have normally distributed processing times and a common deterministic due date. We develop new approaches for this problem that generate near optimal solutions. The original stochastic problem is transformed into a non-linear integer programming model and its relaxations. Computational study validates their effectiveness by comparison with optimal solutions.

[1]  Prabuddha De,et al.  On the minimization of the weighted number of tardy jobs with random processing times and deadline , 1991, Comput. Oper. Res..

[2]  Xiaoqiang Cai,et al.  Scheduling stochastic jobs with asymmetric earliness and tardiness penalties , 1997 .

[3]  Masaaki Kijima,et al.  Stochastic orders and their applications in financial optimization , 1999, Math. Methods Oper. Res..

[4]  Wooseung Jang,et al.  Dynamic scheduling of stochastic jobs on a single machine , 2002, Eur. J. Oper. Res..

[5]  Hossein Soroush,et al.  The stochastic single machine scheduling problem with earliness and tardiness costs , 1994 .

[6]  Stephen J. Balut,et al.  Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain , 1973 .

[7]  Chen-Sin Lin,et al.  Single-machine stochastic scheduling with dual criteria , 1995 .

[8]  David D. Yao,et al.  Rearrangement, Majorization and Stochastic Scheduling , 1993, Math. Oper. Res..

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  Hiroshi Kise,et al.  Note-On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem , 1983 .

[11]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[12]  Subhash C. Sarin,et al.  Sequencing jobs on a single machine with a common due date and stochastic processing times , 1991 .

[13]  O. J. Boxma,et al.  Minimizing the expected weighted number of tardy jobs in stochastic flow shops , 1986 .

[14]  Kenneth Porter.  Visual interactive simulation as a communication tool — A case study , 1991 .