Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Scheduling Methods for a Hybrid Flowshopwith Dynamic Order Arrival

주문 생산 방식을 따르는 혼합 흐름 공정에서의일정계획에 관한 연구

  • 이근철 (건국대학교 경영대학 경영.경영정보학부 경영학전공)
  • Published : 2006.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a scheduling problem for a hybrid flowshop with dynamic order arrival. A hybrid flowshop is an extended form of a flowshop, which has serial stages like a flowshop but there can be more than one machine at each stage. In this paper, we propose a new method for the problem of scheduling with the objective of minimizing mean tardiness of orders which arrive at the shop dynamically. The proposed method is based on the list scheduling approach, however we use a more sophisticated method to prioritize lots unlike dispatching rule-based methods. To evaluate the performance of the proposed method, a simulation model of a hybrid flowshop-type production system is constructed. We implement well-known dispatching rules and the proposed methods in the simulation model. From a series of simulation tests, we show that the proposed methods perform better than other methods.

Keywords

References

  1. Alisantoso, D., Khoo, L. P., and Jiang, P. Y. (2003), An immune algorithm approach to the scheduling of a flexible PCB flow shop. International Journal of Advanced Manufacturing Technology, 22, 819-827 https://doi.org/10.1007/s00170-002-1498-5
  2. Azizoglu, M., Cakmak, E. and Kondakci, S. (2001), A flexible flowshop problem with total flow time minimization. European Journal of Operational Research, 132, 528-538 https://doi.org/10.1016/S0377-2217(00)00142-9
  3. Bengu, G. (1994), A simulation-based scheduler for flexible flowlines. International Journal of Production Research, 32, 321-344 https://doi.org/10.1080/00207549408956936
  4. Brah, S. A. (1996), A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Production Planning and Control, 7, 362-373
  5. Brah, S. A. and Loo, L. L. (1999), Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research, 113, 113-122 https://doi.org/10.1016/S0377-2217(97)00423-2
  6. Cheng, J., Karuno, Y., and Kise, H. (2001), A shifting bottleneck approach for a parallel machine flowshop scheduling problem. Journal of the Operations Research Society of Japan, 44, 140-156 https://doi.org/10.15807/jorsj.44.140
  7. Choi, S-W., Kim, Y-D., and Lee, G-C. (2005), Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research, 43, 2049-2067 https://doi.org/10.1080/00207540500031865
  8. Guinet, A. G. P. and Solomon, M. M. (1996), Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34,1643-1654 https://doi.org/10.1080/00207549608904988
  9. Gupta, J. N. D., Hariri, A. M. A., and Potts, C. N. (1997), Scheduling a two-stage flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171-191 https://doi.org/10.1023/A:1018976827443
  10. Huang, W. and Li, W. (1998), A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling, 27, 27-45
  11. Jin, Z. H., Ohno, K., Ito, T., Elmaghraby, S. E. (2002), Scheduling hybrid flowshops in printed circuit board assembly lines. Production and Operations Management, 11, 16-230
  12. Kis, T. and Pesch, E. (2005), A review of exact solution methods for the on-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164, 592-608 https://doi.org/10.1016/j.ejor.2003.12.026
  13. Kochhar, S. and Morris, R. J. T. (1987), Heuristic methods for flexible flow line scheduling, Journal of Manufacturing Systems, 6, 299-314 https://doi.org/10.1016/0278-6125(87)90006-9
  14. Kurz, M. E. and Askin, R. G. (2003), Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85, 371-388 https://doi.org/10.1016/S0925-5273(03)00123-3
  15. Lee, G-C., Kim, Y-D., Kim, J-G., and Choi, S-H. (2003), A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. Journal of the Operational Research Society, 54,1038-1049 https://doi.org/10.1057/palgrave.jors.2601601
  16. Lee, G-C., Kim, Y-D., and Choi, S-W. (2004), Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research, 42, 165-181 https://doi.org/10.1080/00207540310001602892
  17. Lee, Y. H. and Pinedo, M. (1997), Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research, 100, 464-474 https://doi.org/10.1016/S0377-2217(95)00376-2
  18. Moursli, O. and Pochet, Y. (2000), A branch-and-bound algorithm for the hybrid flowshop. International Journal of Production Economics, 64, 113-125 https://doi.org/10.1016/S0925-5273(99)00051-1
  19. Nawaz, M., Enscore, E., and Ham, I. (1983), A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA, The International Journal of Management Science, 11, 91-95
  20. Quadt, D. (2004), Lot-sizing and scheduling for flexible flow lines, Lecture notes in economics and mathematical systems, Springer, Berlin Germany
  21. Wang, H. (2005), Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions, Expert Systems, 22, 78-85 https://doi.org/10.1111/j.1468-0394.2005.00297.x