An Efficient Dispatching Rule in One-of-a-Kind Assembly Production

Abstract:

In this paper, we researched a one-of-a-kind assembly production system where every product is unique (i.e. each product has its unique tree-like process route) and arrives one by one randomly with the exponentially distributed inter arrival times. We proposed a new effective combined dispatching rule (LFD/RPS/CP rule) that is constructed by considering three factors: the latest finishing date (LFD), the remaining path size (RPS) and whether an operation is on the critical path (CP). We did many numerical experiments to compare the efficiency between the proposed rule and other rules that were reported in existing studies such as LFD rule and EDD rule. The performance analysis shows that the proposed dispatching rule is more effective in reducing the number of tardy products and total tardiness time.

• Periodical: Advanced Materials Research (Volumes 452-453)
• Pages: 432-436
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.452-453.432
• Online since: January 2012
• Authors: Ming Li, Ji Hua Cao
• Keywords: Assembly, Dispatching Rule, Dynamic Scheduling, One-of-a-Kind Production

References

[1] J.C. Wortmann. Production management systems for one-of-a-kind products. Computers in Industry, Vol.19(1992), p.79–88.

DOI: 10.1016/0166-3615(92)90008-b

[2] R.Rangsatitratsamee, W.G. Ferrell, and M.B. Kurz, Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering, Vol.46(2004), p.1–15.

DOI: 10.1016/j.cie.2003.09.007

[3] T.C. Chiang, and L.C.Fu. Using dispatching rules for job shop scheduling with due date-based objectives. International Journal of Production Research, Vol.44(2007), pp.3245-3262.

DOI: 10.1080/00207540600786715

[4] P.D.D. Dominic, S.Kaliyamoorthy, and M.S. Kumar. Efficient dispatching rules for dynamic job shop scheduling. International Journal of Advanced Manufacturing Technology, Vol.24(2004), pp.70-75.

DOI: 10.1007/s00170-002-1534-5

[5] W.Mouelhi-Chibani and H.Pierreval. Training a neural network to select dispatching rules in real time. Computers and Industrial Engineering, Vol.58(2010), pp.249-256.

DOI: 10.1016/j.cie.2009.03.008

[6] M.K. Reeja and C.Rajendran. Dispatching rules for scheduling in assembly jobshops – part 1. International Journal of Production Research, Vol.38(2000), pp.2051-2066.

DOI: 10.1080/002075400188492

[7] K.M. Mohanasundaram, K.Natarajan, G.Viswanathkumar, P.Radhakrishnan, and C.Rajendran. Scheduling rules for dynamic shops that manufacture multi-level jobs. Computers and Industrial Engineering Vol.44(2002), pp.119-131.

DOI: 10.1016/s0360-8352(02)00188-2

[8] B.K. Choi and N.K. You. Dispatching rules for dynamic scheduling of one-of-a-kind production. International Journal of Computer Integrated Manufacturing, Vol.19(2006), pp.383-392.

DOI: 10.1080/09511920500407541

[9] C.Hicks, D.P. Song, and C.F. Earl. Dynamic scheduling for complex engineer-to-order products. International Journal of Production Research, Vol.45(2007), pp.3477-3503.

DOI: 10.1080/00207540600767772