Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The car sequencing problem is a widespread short-term decision problem, in which sequences of different car models launched down a mixed-model assembly line are to be determined. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, in a subsequence of a certain length by applying sequencing rules. Existing research invariably assumes that the model sequence can be planned with all degrees of freedom. However, in real-world, the sequence of cars in each department can not be arbitrarily changed but depends on the sequence in previous departments and disturbances like machine breakdowns, rush orders, or material shortages. Therefore, in reality. | JGU JOHANNES G UTE N B E RG UNIVERSITATMAINZ The Car Resequencing Problem Nils Boysen Uli Golle Franz Rothlauf Working Paper 01 2010 June 2010 Working Papers in Information Systems and Business Administration Johannes Gutenberg-University Mainz Department of Information Systems and Business Administration D-55128 Mainz Germany Phone 49 6131 39 22734 Fax 49 6131 39 22185 E-Mail sekretariat at wi.bwl.uni-mainz.de Internet http wi.bwl.uni-mainz.de The Car Resequencing Problem Nils Boysena Uli Golle6 Franz Rothlauf6 Friedrich-Schiller-Universitat Jena Lehrstuhl fur Operations Management Carl-Zeifi-Strafie 3 D-07743 Jena Germany nils.boysen@uni-jena.de bJohannes Gutenberg-Universitat Mainz Lehrstuhl fur Wirtschaftsinformatik und BWL Jakob-Welder-Weg 9 D-55128 Mainz Germany golle rothlauf @uni-mainz.de June 10 2010 Abstract The car sequencing problem is a widespread short-term decision problem in which sequences of different car models launched down a mixed-model assembly line are to be determined. To avoid work overloads of workforce car sequencing restricts the maximum occurrence of labor-intensive options e.g. a sunroof in a subsequence of a certain length by applying sequencing rules. Existing research invariably assumes that the model sequence can be planned with all degrees of freedom. However in real-world the sequence of cars in each department can not be arbitrarily changed but depends on the sequence in previous departments and disturbances like machine breakdowns rush orders or material shortages. Therefore in reality the sequencing problem often turns into a resequencing problem. Here a given model sequence has to be reshuffled with the help of resequencing buffers denoted as pull-off tables . This paper formulates the car resequencing problem where pull-off tables can be used to reshuffle a given initial sequence and rule violations are minimized. The problem is formalized and problem-specific exact and heuristic solution procedures are developed and .
