Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Setup Minimization Problem in a Diverging Point of the Conveyor System

컨베이어 시스템 분기점에서의 셋업 최소화 문제

  • Kim, Hyoungtae (Department of Global Service management, Woosong University) ;
  • Han, Yong-Hee (Department of entrepreneurship and Small Business, Soongsil University)
  • 김형태 (우송대학교 글로벌서비스경영학부) ;
  • 한용희 (숭실대학교 벤처중소기업학과)
  • Received : 2013.08.22
  • Accepted : 2013.09.11
  • Published : 2013.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

Keywords

References

  1. Assad, A.A., Models for rail transportation. Transportation Research, 1980, Vol. 14, No. 3, p 205-220. https://doi.org/10.1016/0191-2607(80)90017-5
  2. Assad, A.A., Analytical models in rail transportation : An annotated bibliography, INFOR, 1981, Vol. 19, p 59-80.
  3. Atassi, F.R., Implementation of block painting in Ford's in-line vehicle sequencing environment (MS Thesis). System Design and Management Program. Cambridge, MIT, 1996.
  4. Bastani, A.S. Closed-loop conveyor systems with breakdown and repair of unloading stations. IIE Transactions, 1990, Vol. 22, No. 4, p 351-360. https://doi.org/10.1080/07408179008964189
  5. Baybars, I., A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 1986, Vol. 32, p 909-932. https://doi.org/10.1287/mnsc.32.8.909
  6. Bazaraa, M.S., Jarvis, J.J., and Sherali, H.D., Linear Programming and Network Flows, John Wiley and Sons, 1990.
  7. Bolat, A., Savsar, M., and Al-Fawzan, M.A., Algorithms for real-time scheduling of jobs on mixed model assembly lines. Computers and Operations Research, 1994, Vol. 21, p 487-498. https://doi.org/10.1016/0305-0548(94)90098-1
  8. Bozer, Y.A., Quiroz, M.A., and Sharp, G.P., An evaluation of alternative control strategies and design issues for automated order accumulation and sortation systems. Material Flow, 1988, Vol. 4, p 265-282.
  9. Bozer, Y.A. and Sharp, G.P., An empirical evaluation of general purpose automated order accumulation and sortation system used in batch picking. Material Flow 1985, Vol. 2, p 111-131.
  10. Bruno, J. and Downey, P., Complexity of task sequencing with deadlines, setup times, and changeover costs. SIAM Journal of Computing, 1978, Vol. 7, p 394-404.
  11. Burns, L.D. and Daganzo, C.F., Assembly line job sequencing principles. International Journal of Production Research, 1987, Vol. 25, p 71-99. https://doi.org/10.1080/00207548708919824
  12. Campos, M., Bonabeau, E., and Theraulaz, G., Dynamic scheduling and division of labor in social insects. Adaptive Behavior, 2001, Vol. 8, No. 2, p 83-92.
  13. Choe, K.I., Aisle-based order pick systems with batching, zoning, and sorting (Ph. D. Thesis). School of Industrial and Systems Engineering. Atlanta, GA, Georgia Institute of Technology, 1990.
  14. Choe, K.I. and Sharp, G.P., Small parts order picking : design and operations, Material Handling Research Center Technical Report MHRC-TR-89-07, Georgia Institute of Technology, Atlanta, GA, 1991.
  15. Choe, K.I. and Sharp, G.P., Performance estimation of an automated sorting system. Proceedings of the 12th International Conference on Automation in Warehousing, 1992, p 198-204.
  16. Choe, K.I. and Sharp, G.P., Aisle-based order pick systems with batching, zoning, and sorting. Progress in Material Handling Research, Material Handling Institute, Charlotte, 1993, p 245-276.
  17. Cordeau, J.F., Toth, P., and Vigo, D., A Survey of optimization models for train routing and scheduling. Transportation Science, 1998, Vol. 32, No. 4, p 380-404. https://doi.org/10.1287/trsc.32.4.380
  18. Daganzo, C.F., Static blocking at railyards : sorting implications and track requirements. Transportation Science, 1986, Vol. 20, p 189-199. https://doi.org/10.1287/trsc.20.3.189
  19. Daganzo, C.F., Dynamic blocking for railyards, part I. homogeneous traffic. Transportation Research, 1987a, 21B, p 1-27.
  20. Daganzo, C.F., Dynamic blocking for railyards, part II. heterogeneous traffic. Transportation Research, 1987b, 21B, p 29-40.
  21. Daganzo, C.F., Dowling, R.G., and Hall, R.W., Railroad classification yard throughput : the case of multi -stage triangular sorting. Transportation Research, 1983, Vol. 17, No. 2, p 95-106. https://doi.org/10.1016/0191-2607(83)90063-8
  22. Gould, L., New Sortation systems cuts postal costs $2 million per year. Modern Materials Handling, 1991, Vol. 46, No. 10, p 54-55.
  23. Gould, L., Sortation system doubles output capacity. Modern Materials Handling, 1991, Vol. 46, No. 6, p 50-51.
  24. Han, Y., Dynamic sequencing of jobs on conveyor systems for minimizing changeovers (Ph. D. Thesis), in School of Industrial and Systems Engineering Atlanta : Georgia Institute of Technology, 2004.
  25. Han, Y., Optimal Conveyor Selection Problem on a Diverging Conveyor Junction Point. Journal of the Society of Korea Industrial and Systems Engineering, 2009, Vol. 32, No. 3, p 118-126.
  26. Horrey, R.J., Sortation systems : from push to highspeed fully automated applications, Proceedings of the 5th International Conference on Automation in Warehousing, Atlanta, GA, 1983.
  27. Johnson, M.E., The impact of sorting strategies on automated sortation system performance. IIE Transactions, 1998, Vol. 30, p 67-77. https://doi.org/10.1080/07408179808966438
  28. Johnson, M.E. and Lofgren, T., Model decomposition speeds distribution center design. Interfaces, 1994, Vol. 24, No. 5, p 95-106. https://doi.org/10.1287/inte.24.5.95
  29. Kittithreerapronchai, O. and Anderson, C., Do ants paint trucks better than chickens? Market versus response thresholds for distributed dynamic scheduling, Proceedings of the 2003 IEEE Congress on Evolutionary Computation, Canberra, Australia, 2003.
  30. Laporte, G., The traveling salesman problem : an overview of exact and approximate algorithms. European Journal of Operational Research, 1992, Vol. 59, p 231-247. https://doi.org/10.1016/0377-2217(92)90138-Y
  31. Lee, C.Y. and Vairaktarakis, G., Workforce planning in mixed model assembly systems. Operations Research, 1997, Vol. 45, p 553-567. https://doi.org/10.1287/opre.45.4.553
  32. Meller, R.D., Optimal order-to-lane assignments in an order accumulation/sortation system. IIE Transactions, 1997, Vol. 29, p 293-301.
  33. Monma, C.L. and Potts, C.N., On the complexity of scheduling with batch setup times. Operations Research, 1999, Vol. 37, p 798-804.
  34. Morley, R., Painting trucks at General Motors : the effectiveness of a complexity-based approach. Cambridge, The Ernst and Young Center for Business Innovation, 1996, p 53-58.
  35. Morley, R. and Ekberg, G., Cases in chaos : complexity- based approaches to manufacturing. The Ernst and Young Center for Business Innovation, 1998, p 97-102.
  36. Morley, R. and Schelberg, C., An analysis of a plantspecific dynamic scheduler, Final Report, Intelligent. Dynamic Scheduling for Manufacturing Systems, 1993, p 115-122.
  37. Muth, E.J., Conveyor theory : a survey. AIIE Transactions, 1979, Vol. 11, No. 4, p 270-277. https://doi.org/10.1080/05695557908974471
  38. Myron, D.L., Paint blocking in Ford's in-line vehicle sequencing environment (MS Thesis), Leaders for Manufacturing Program. Cambridge, MIT, 1996.
  39. Nemhauser, G.L. and Wolsey, L.A., Integer and Combinatorial Optimization, John Wiley and Sons, Inc., 1988.
  40. Potts, C.N. and Wassenhove, L.N.V., Integrating scheduling with batching and lot-sizing : a review of algorithms and complexity. Journal of Operational Research Society, 1992, Vol. 43, p 395-406. https://doi.org/10.1057/jors.1992.66
  41. Schwind, G.F., High speed distribution at Walden books. Material Handling Engineering November, 1992, p 76-80.
  42. Shapiro, J., Mathematical programming : structures and algorithms. New York, Wiley, 1979.
  43. Siddiqee, M.W., Investigation of Sorting and Train Formation Schemes for a Railroad Hump Yard, Traffic Flow and Transportation, G.F. Newell. New York, Elsevier, 1972, p 377-387.
  44. Unal, A.T. and Kiran, A.S., Batch sequencing. IIE Transactions, 1992, Vol. 24, p 73-83. https://doi.org/10.1080/07408179208964235
  45. Webster, S. and Baker, K.R., Scheduling groups of jobs on a single machine. Operations Research, 1995, Vol. 43, p 692-703. https://doi.org/10.1287/opre.43.4.692
  46. Witt, C.E., Reebok's distribution on fast track. Material Handling Engineering March, 1989, p 43-46.
  47. Yagar, S., Saccomanno, F.F., and Shi, Q., An efficient sequencing model for humping in a rail yard. Transportation Research, 1983, Vol. 17A, p 251-262.
  48. Yano, C.A. and Bolat, A., Survey, development, and application of algorithms for sequencing paced assembly lines. Journal of Manufacturing Operations Management, 1989, Vol. 2, p 172-198.
  49. Yano, C.A. and Rachamadugu, R., Sequencing to Minimize Work Overload in Assembly Lines with Product Options. Management Science, 1991, Vol. 37, No. 5, p 572-586. https://doi.org/10.1287/mnsc.37.5.572