Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs

Abstract

In this research, minimizing the expected number of tardy jobs in a dynamic m machine flow-shop scheduling problem, i.e., \( {F_m}\left| {{r_j}\left| {{\text{E}}\left[ {\sum {{U_j}} } \right]} \right.} \right. \) is investigated. It is assumed that the jobs with deterministic processing times and stochastic due dates arrive randomly to the flow-shop cell. The due date of each job is assumed to be normally distributed with known mean and variance. A dynamic method is proposed for this problem by which the m machine stochastic flow-shop problem is decomposed into m stochastic single-machine sub-problems. Then, each sub-problem is solved as an independent stochastic single-machine scheduling problem by a mathematical programming model. Comparison of the proposed method with the most effective rule of thumb for the proposed problem, i.e., shortest processing time first rule shows that the proposed method performs 23.9 % better than the SPT rule on average for industry-size scheduling problems.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Gutjahr WJ, Hellmayr A, Pflug GCh (1999) Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound. Eur J Oper Res 117:396–413

  2. 2.

    Pinedo ML (2008) Scheduling: Theory, algorithms, and systems, 3rd edn. Prentice Hall, New York

  3. 3.

    Alcaide D, Rodriguez-Gonzalez A, Sicilia J (2002) An approach to solve the minimum expected makespan flow shop problem subject to breakdowns. Eur J Oper Res 140:384–398

  4. 4.

    Seo DK, Klein CM, Jang W (2005) Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Comput Ind Eng 48:153–161

  5. 5.

    Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15:102–109

  6. 6.

    Balut SJ (1973) Scheduling to minimize the number of late jobs when setup and processing times are uncertain. Manag Sci 19:1283–1288

  7. 7.

    Kise H, Ibaraki T (1983) On Balut's algorithm and NP-completeness for a chance constrained scheduling problem. Manag Sci 29:384–388

  8. 8.

    Pinedo ML (1983) Stochastic scheduling with release dates and due dates. Oper Res 31:559–572

  9. 9.

    Boxma OJ, Forst FG (1986) Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Oper Res Lett 5:119–126

  10. 10.

    Lee CY, Lin CS (1991) Stochastic flow shop scheduling with lateness-related performance measures. Probab Eng Inf Sci 5:245–254

  11. 11.

    Emmons H, Pinedo ML (1990) Scheduling stochastic jobs with due dates on parallel machines. Eur J Oper Res 47:49–55

  12. 12.

    Sarin SC, Erel E, Steiner G (1991) Sequencing jobs on a single machine with a common due date and stochastic processing times. Eur J Oper Res 51:188–198

  13. 13.

    De P, Ghosh JB, Wells CE (1991) On the minimization of the weighted number of tardy jobs with random processing times and deadline. Comput Oper Res 18:457–463

  14. 14.

    Jang W (2002) Dynamic scheduling of stochastic jobs on a single machine. Eur J Oper Res 138:518–530

  15. 15.

    van den Akker JM, Hoogeveen JA (2008) Minimizing the number of late jobs in a stochastic setting using a chance constraint. J Sched 11:59–69

  16. 16.

    Trietsch D, Baker KR (2008) Minimizing the number of tardy jobs with stochastically-ordered processing times. J Sched 11:71–73

  17. 17.

    Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362

  18. 18.

    Uetz M (2001) Algorithms for deterministic and stochastic scheduling. PhD thesis, Institut für Mathematik, Technische Universität

  19. 19.

    Lodree E, Jang W, Klein CM (2004) A new rule for minimizing the number of tardy jobs in dynamic flow shops. Eur J Oper Res 159:258–263

  20. 20.

    Murty KG (1983) Linear programming. Wiley, New York

  21. 21.

    Barrett R, Kadipasaoglu S (1990) dispatching rules for a dynamic flow shop. Prod Inventory Manag J (First Quarter):54-58

  22. 22.

    Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flow shops and job shops. Eur J Oper Res 116:156–170

  23. 23.

    Hariri A, Potts C (1989) A branch and bound algorithm to minimize the number of late jobs in a permutation flow shop. Eur J Oper Res 38:228–237

  24. 24.

    LINGO Release 11.0 (2008) Lindo systems Inc. Chicago: USA

  25. 25.

    SPSS Release 16.0 (2008) SPSS Inc. Chicago: USA

  26. 26.

    Montgomery DC (1996) Design and analysis of experiments, 4th edn. Wiley, New York

Download references

Author information

Correspondence to Nasser Salmasi.

Appendix

Appendix

Table 2 ANOVA table for comparison of the three methods
Table 3 Tukey's test for simultaneous paired comparisons of methods

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Elyasi, A., Salmasi, N. Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs. Int J Adv Manuf Technol 66, 337–346 (2013). https://doi.org/10.1007/s00170-012-4328-4

Download citation

Keywords

  • Stochastic scheduling
  • Flow-shop
  • Tardy jobs
  • Dynamic scheduling
  • Release dates