컨베이어 분기점에서의 최적 인출 컨베이어 선택 문제
Optimal Conveyor Selection Problem on a Diverging Conveyor Junction Point
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.
Abstract
This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.
참고문헌 (28)
- 김경태, "공장 자동화 시스템의 컴퓨터 시뮬레이션 분석에 관한 연구", 석사, pp.1992
- 김원경, "자동차 도장공정의 생산성 향상을 위한 시뮬레이션 분석", 한국시뮬레이션학회 논문지, 8(2) (1999)
- 문덕희, "자동차 공장에서 CRS와 PBS의 전용레인 설치에 관한 시뮬레이션 연구", 한국시뮬레이션학회 2004 춘계학술대회 논문집, pp.77~82 (2004)
- 문덕희, "자동차 도장공장의 Color Rescheduling Storage 설치를 위한 시뮬레이션 분석", IE Interfaces, 16(2), pp.211~221 (2003)
- 박혜규, "자동차 도장공장의 Color Selection 시스템의 자동화", 산업공학, 9(2), pp.19~37 (1996)
- 정은도, "도장실무 핸드북", pp.11~ (1990), 일진사
- 최원준, "도장부스가 2개인 자동차 조립 공장의 생산 순서 계획 작성", 한국 경영과학회, 1997, 451~454
- Ascheuer, N., "Hamiltonian path problems in the on-line optimization of flexible manufacturing systems", 박사, pp.1995
- Atassi, F. R., "Implementation of block painting in Ford’s in-line vehicle sequencing environment", 석사, System Design and Management Program Cambridge, pp.1996
- Bonsma, P., "Complexity results on restricted instances of a paint shot problem for words", Discrete Applied Mathematics, 154, pp.1335~1343 (2006)
- Campos, M., "Dynamic scheduling and division of labor in social insects", Adaptive Behavior, 8, pp.83~92 (2001)
- Choe, K. I., "Aisle-based order pick systems with batching, zoning, and sorting", Progress in Material Handling Research (1993)
- Daganzo, C. F., "Static blocking at railyards : Sorting implications and track requirements", Transportation Science, 20, pp.189~199 (1986)
- Escudero, L., "An inexact algorithm for the sequential ordering problem", European Journal of Operational Research, 37, pp.236~253 (1988)
- Overview on sequencing in mixed model flowshop production line with static and dynamic context, "Färber, G.", Universitat Politècnica de Catalunya, ~, pp.Internal report IOC-DT-P-2005-7 (2005)
- Gambardella, L., "An ant colony system hybridized with a new local search for the sequential ordering problem", INFORMS Journal on Computing, 12, pp.237~255 (2000)
- Han, Y., "Dynamic sequencing of jobs on conveyor systems for minimizing changeovers", 박사, pp.2004
- Jeong, M. K., "Throughput Gain with Parallel Flow in Automated Flow Lines", IEEE Transactions on Automation Science and Engineering, 2, pp.84~86 (2005)
- Kittithreerapronchai, O., "Do ants paint trucks better than chickens? Market versus response thresholds for distributed dynamic scheduling", Proceedings of the 2003 IEEE Congress on Evolutionary Computation (2003)
- Lahmar, M., "Sequencing with limited flexibility", IIE Transactions, 39, pp.937~955 (2007)
- Lim, A., "Searching optimal resequencing and feature assignment on an automated assembly line", Journal of the Operational Research Society, 60(3), pp.361~371 (2009)
- Painting trucks at General Motors : The effectiveness of a complexity-based approach, "Morley, R.", The Ernst and Young Center for Business Innovation, ~ (1996)
- Cases in chaos : Complexity-based approaches to manufacturing, "Morley, R.", The Ernst and Young Center for Business Innovation, ~
- An analysis of a plant-specific dynamic scheduler, "Morley, R.", Intelligent, Dynamic Scheduling for Manufacturing Systems, 115~122 (1993)
- Myron, D. L., "Paint blocking in Ford’s in-line vehicle sequencing environment", 석사, Leaders for Manufacturing Program Cambridge, pp.1996
- Siddiqee, M. W., "Investigation of Sorting and Train Formation Schemes for a Railroad Hump Yard. in : Traffic Flow and Transportation", pp.377~387 (1972), Elsevier
- Spieckermann, S., "A sequential ordering problem in automotive paint shops", International Journal of Production Research, 42, pp.1865~1878 (2004)
- Yagar, S., "An efficient sequencing model for humping in a rail yard", Transportation Research, 17A, pp.251~262 (1983)