Skip to main content
SpringerLink
Log in

A dispatching algorithm considering process quality and due dates: an application for re-entrant production lines

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper presents a parallel machine scheduling problem with process quality, due dates, and sequence-dependent setup times. The process capability indices are utilized to measure the process quality level between job and machine. The dispatching algorithm named quality and rework with due dates (QRD) is proposed in this paper focusing on the rework processes due to quality issue. The performance of QRD is measured by two ways: one is quality-related performance indicator—process capability index—and the other is due date related ones: maximum lateness, mean flow time, and the number of reworks. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hsieh JC, Chang PC, Hsu LC (2003) Scheduling of drilling operations in printed circuit board factory. Comput Ind Eng 44:461–473

    Article  Google Scholar 

  2. Shin HJ, Kang YH (2010) A rework-based dispatching algorithm for module process in TFT-LCD manufacture. Int J Prod Res 48:915–931

    Article  MATH  Google Scholar 

  3. Flapper SDP, Fransoo JC, Broekmeulen RACM, Inderfurth K (2002) Planning and control of rework in the process industries: review. Prod Plan Control 13:26–34

    Article  Google Scholar 

  4. Lee HL (1992) Lot sizing to reduce capacity utilization in a production process with defective items, process corrections and rework. Manag Sci 38:1314–1328

    Article  MATH  Google Scholar 

  5. Liu JJ, Yang P (1996) Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs. Eur J Oper Res 91:517–527

    Article  MATH  Google Scholar 

  6. Kim CH (2005) An EMQ model with rework. J Korean Inst Ind Eng 31:173–179

    Google Scholar 

  7. Shin JS, Han JY, Jeong BJ (2006) Comparative analysis of rework policies in multistage production system. J Korean Inst Ind Eng 32:29–41

    Google Scholar 

  8. Teunter RH, Flapper SDP (2003) Lot-sizing for a single-product production system with rework of perishable production defectives. OR Spectr 25:85–96

    Article  MATH  MathSciNet  Google Scholar 

  9. Zargar AM (1995) Effect of rework strategies on cycle time. Comput Ind Eng 29:239–243

    Article  Google Scholar 

  10. Agnihorthri SR, Kenett RS (1995) The impact of defects on a process with rework. Eur J Oper Res 80:308–327

    Article  Google Scholar 

  11. Sha DY, Hsu SY (2004) The effects of rework on the shopfloor control in wafer fabrication. J Manuf Technol Manag 15:184–198

    Article  Google Scholar 

  12. Flapper SDP, Teunter RH (2004) Logistic planning of rework with deteriorating work in process. Int J Prod Econ 88:51–59

    Article  Google Scholar 

  13. Lee DH, Ko HH, Kim SS (2005) A study of strategy for planning of rework in semiconductor monitoring burn in test process. IE Interfaces 18:350–360

    Google Scholar 

  14. Kuhl ME, Laubisch GR (2004) A simulation study of dispatching rules and rework strategies in semiconductor manufacturing. Adv Semicond Manuf ASMC '04. IEEE Conf Work 325–329

  15. Sha DY, Hsu SY, Che ZH, Chen CH (2006) A dispatching rule for photolithography scheduling with an online rework strategy. Comput Ind Eng 50:233–247

    Article  Google Scholar 

  16. Ko HH, Kim JH, Kim SS, Baek JG (2010) Dispatching rule for non-identical parallel machines with sequence-dependent setups and quality restrictions. Comput Ind Eng 59:448–457

    Article  Google Scholar 

  17. Porter LJ, Oakland JS (1991) Process capability indices—an overview of theory and practice. Qual Reliab Eng Int 7:437–448

    Article  Google Scholar 

  18. Tang LC, Than SE (1999) Computing process capability indices for non-normal data: a review and comparative study. Qual Reliab Eng Int 15:339–353

    Article  Google Scholar 

  19. Juran AM, Gryna FM (1980) Quality planning and analysis, 2nd edn. McGraw-Hill, New York, pp 70–105

    Google Scholar 

  20. Montgomery D (2004) Introduction to statistical quality control. Wiley, New York, pp 28–41

    Google Scholar 

  21. Booker JM, Raines M, Swift KG (2001) Designing capable and reliable products. Butterworth-Heinemann, Oxford, pp 57–98

    Google Scholar 

  22. Lee YH, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Eur J Oper Res 100:464–474

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Engineering, Sangmyung University, Cheonan, 330-720, Republic of Korea

    Hyun Joon Shin

Authors
  1. Hyun Joon Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hyun Joon Shin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shin, H.J. A dispatching algorithm considering process quality and due dates: an application for re-entrant production lines. Int J Adv Manuf Technol 77, 249–259 (2015). https://doi.org/10.1007/s00170-014-6436-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-014-6436-9

Keywords

Search

Navigation