工業(yè)工程精益生產(chǎn)外文翻譯

上傳人:y**** 文檔編號(hào):46843750 上傳時(shí)間:2021-12-15 格式:DOC 頁(yè)數(shù):15 大小:52KB
收藏 版權(quán)申訴 舉報(bào) 下載
工業(yè)工程精益生產(chǎn)外文翻譯_第1頁(yè)
第1頁(yè) / 共15頁(yè)
工業(yè)工程精益生產(chǎn)外文翻譯_第2頁(yè)
第2頁(yè) / 共15頁(yè)
工業(yè)工程精益生產(chǎn)外文翻譯_第3頁(yè)
第3頁(yè) / 共15頁(yè)

下載文檔到電腦,查找使用更方便

20 積分

下載資源

還剩頁(yè)未讀,繼續(xù)閱讀

資源描述:

《工業(yè)工程精益生產(chǎn)外文翻譯》由會(huì)員分享,可在線閱讀,更多相關(guān)《工業(yè)工程精益生產(chǎn)外文翻譯(15頁(yè)珍藏版)》請(qǐng)?jiān)谘b配圖網(wǎng)上搜索。

1、Literature review of JIT-KANBAN system AbstractIn this paper, JIT (Just-In-Time) —KANBANliterature survey was carried out and presented.Theintroductory section deals with the philosophy of JIT,andthe concept involved in the push and pull system. Theblocking mechanisms in the kanban system are alsod

2、iscussed elaborately。 Besides these sections, the importanceof measure of performance (MOP) and the applicationof the same with respect to JIT-KANBAN arepresented。 The recent trends in the JIT-KANBAN arediscussed under the heading “Special cases”. In this review,100 state—of-art research papers have

3、 been surveyed. Thedirections for the future works are also presented. 1 Introduction Just —In—Time (JIT) manufacturing system was developedby Taiichi Ohno which is called Japanese “Toyotaproduction system”JIT manufacturing system has theprimary goal of continuously reducing and ultimatelyeliminat

4、ing all forms of wastes (Brown et al。 [5],Ohno[54], Sugimori et al. [82])。 Based on this principle,Japanese companies are operating with very low level ofinventory and realizing exceptionally high level of qualityand productivity (Richard J。 Tersine [62], James H。 Greene [30])。 JIT emphasizes “zero

5、concept” which meansachievement of the goals of zero defects, zero queues,zero inventories, zero breakdown and so on. It ensures thesupply of right parts in right quantity in the right place andat the right time. Hence, the old system of materialacquisition and, buyer and seller relationships are ch

6、angedto new revolutionary concepts (Womack et al。 [91],Womack and Jones [92], Markey et al. [45])。 Similarly,JIT becomes an inevitable system at plant level, whichintegrates the cellular manufacturing, flexible manufacturing,computer integrated manufacturing and Robotics(Schonberger [63], Golhar [12

7、]). Due to the technological advancement, the conventionalmethod of push production system linked with MaterialRequirement Planning (MRP) was changed to pull type JITproduction system to meet out the global competition,where the work-in—process (WIP) can be managed andcontrolled more accurately tha

8、n the push— productionsystem (Mason Paul [46]). KANBAN system is a new philosophy, which plays asignificant role in the JIT production system。 Kanban isbasically a plastic card containing all the informationrequired for productionassembly of a product at each stageand details of its path of complet

9、ion。 The kanban system isa multistage production scheduling and inventory controlystem。 These cards are used to control production flowsand inventory。 This system facilitates high productionvolume and high capacity utilization with reduced productiontime and work—in-process。 The objectives of this

10、paper are as listed below 1) Critical review of JIT literature。 2) Segregating the different research articles of JIT。 3) Exploring the recent trends in JIT—Kanban system andderiving directions for future research. In this paper, the articles are reviewed and an appropriateclassification is pres

11、ented。The kanban study was madeelaborately, since it acts as a basic communicator and feedbackagent to the JIT system. Push and pull system,principle of operation of kanban cards, Blocking mechanism,Toyota’s formula, and the measures of performances(MOP) are also discussed in this paper。 The latest

12、trends inJIT—Kanban system are also addressed separately under theheading “Special cases"。 Finally, the directions for futureresearches are presented。 6。1.1 Flow shop Kanban system is widely implemented in repetitivemanufacturing environment. Fora single card operationalsystem, Sharadhapriyadarish

13、ini et al. [77] have developedtwo heuristics and proved that these are more efficient。Saradhapriyadarishini et al。 [78] have proposed a recursiveequation for scheduling the single card kanban system withdual blocking. They proposed a heuristic with twinobjectives of minimizing the sum of total weigh

14、ted timeof containers and weighted flow time of part-types.Rajendran [61] has done a work on two card flow shopscheduling with n part—types. In this paper, mathematicalmodels for time tabling of containers for different problemshave been formulated。 Then, a heuristic was developed tominimize the sum

15、of weighted flow time, weighted earliness,and weighted tardiness of containers. Hemamalini et al. [22]have done similar work。 In this work, the heuristic developedis simulated annealing algorithm. This is compared withrandomsearchmethod. In these papers, the comparisons aredone only based on mean re

16、lative percentage increase。Instead of this approach, comparisons based on completeANOVA experiments would provide reliable inference. Peter Brucker et al。 [58] have carried out research onflow shop problem with a buffer of limited capacitybetween two adjacent machines. After finishing theprocessing

17、 of a job on a machine, either the job is to beprocessed on the following machine or it is to be stored inthe buffer between these machines. If the buffer iscompletely occupied, the job has to wait on its currentmachine but blocks this machine for other jobs。 In thispaper, they determined a feasible

18、 schedule to minimize themakespan using tabu search。 The results of the problemusing tabu search were compared with that of benchmarkinstances. The comparisons are done only based on relativeimprovements。 Instead of this approach, comparisonsbased on complete ANOVA experiments would providereliable

19、inference。 6。1。2 Assembly line Assembly lines are similar to the flow shops in whichassembly of parts are carried out in a line sequence. In amulti product assembly line, the sequencing of the jobs is achallenging task. Drexl et al. [16] considered an assemblyline sequencing mixed model problem. I

20、t is a combinatorialproblem。 They formulated this combinational problem asinteger programming model。 This model can be used onlyfor small size problems due to the limitations of operationsresearch software with respect to handling the number ofvariables and constraints, which are present in the inte

21、gerprogrammingmodel. Xiaobo et al。 [94] have consideredsimilar work on mixed modelassembly line sequencingproblem with conveyor stoppages。 They proposed branchand bound algorithm, and simulated annealing algorithmfor finding the optimal solution and sub—optimal solution ofthe mixed-model sequencing

22、problem, respectively tominimize the total conveyor stoppage time。 The branchand-bound method was devoted to find the optimalsolution of small-sized problems, whereas the simulatedannealing method was used to cope with large—scaleproblems to obtain a good sub—optimal solution。 Future,research on sim

23、ulated annealing applied to this problemcan be directed to establish a better seed generationalgorithm。 However, the practitioner should spend considerabletime in fixing the parameter called temperature(T) in the simulated annealing algorithm by trail and errormethod before actually solving the prob

24、lem。 6.1.3 Batch production system In a batch production system, the switching over from oneproduct to other product depends on many factors such asstock reaching to the threshold level, different priorityschemes, economical setups, etc。 Tafur Altiok et al。 [86]have dealt this issue differently fo

25、r the pull typemanufacturing system with multi product types。 In thispaper, they developed an iterative procedure to approximatelycompute the average inventory level of eachproduct as finished goods using different priority schemes.In this paper, the demand arrival process is assumed to bea poisson

26、distribution and processing times and the set-uptimes are arbitrarily distributed. But, in practice, theprocessing times may follow other distributions, viz.,normal, uniform, exponential, etc。 which are not experimentedin this paper。 Khan et al。 [35] addressed theproblem of manufacturing system that

27、 procures rawmaterials from vendors in lot and convert them intofinished products。 They estimated production batch sizesfor JIT delivery system and designed a JIT raw materialsupply system. A simple algorithm was developed tocompute the batch sizes for both manufacturing and rawmaterial purchasing p

28、olicies. 7 JIT integration, implementation and benefits Just—in-time is a manufacturing philosophy by which anorganization seeks continuous improvements. For ensuringcontinuous improvements, it is necessary for any organizationto implement and integrate the JIT and JIT relatedareas。 If it is pract

29、iced in its true sense, the manufacturingperformance and the financial performance of the systemwill definitely improve. Swanson et al. [83] have reiterated that proper planningis essential for implementation of a JIT manufacturingsystem and a commitment from top management is a prerequisite.Cost b

30、enefit analysis is to be studied initially withthe knowledge of key items such as the cost of conversionto a JIT system and time period of conversion. Cook et al.[11], in their case study for applying JIT in the continuousprocess industry, show improvements in demand forecastand decrease in lead—tim

31、e variability。 The relationship between implementation of TQM, TPMand JIT will lead to improvement in the manufacturingperformance (Kribty et al。 [37])。 Further Huang [23]discusses the importance of considering the integration ofTPM, JIT, Quality control and FA (Factory Automization).Imai [27] beli

32、eves that TQM and TPM are the two pillarssupporting the JIT production system. Kakuro Amasaka [32] proposes a new JIT management system, which helpsto transfer the management technology into managementstrategy。 Fullerton et al. [65] have conducted a study in 253 firmsin USA to evaluate empirically

33、whether the degree withwhich a firm implements the JIT practices affects the firmsfinancial performance。 From their study, JIT manufacturingsystem will reap sustainable rewards as measured byimproved financial performance。 Also, they studied thebenefits of JIT implementation in 95 firms in USA. They

34、have concluded that JIT implementation improves theperformance of the system, because of resultant quality benefits, time based benefits, employees flexibility, accounting simplification, firms profitability and reducedinventory level。 8 Conclusion The growing global competition forces many compan

35、ies toreduce the costs of their inputs so that the companies canhave greater profit margin。 There are considerableadvancements in technology and solution procedures inreality, to achieve the goal of minimizing the costs ofinputs。 JIT-KANBAN is an important system, which isused in production lines of

36、 many industries to minimizework—in—process and throughput time, and maximize lineefficiency。 In this paper, the authors have made an attemptto review the state-of—art of the research articles in the area “JIT—KANBAN system”. After a brief introduction to pushand pull systems, different types of kan

37、ban and theiroperating principles, blocking mechanisms, the authorshave classified the research articles under JIT-KANBANsystem into five major headings, viz。, empirical theory,modeling approach, variability and its effect, CONWIP andJIT-SCM. Also, the authors have provided a section forspecial case

38、s under JIT-KANBAN. This paper would helpthe researchers to update themselves about the currentdirections and different issues under JIT-KANBANsystem, which would further guide them for their futureresearches. The directions for future researches are presented below。 The flow shop as well as mixed

39、 model assembly lineproblems come under combinatorial category。 Hence,meta—heuristics viz。, simulated annealing, genetic algorithmand tabu search may be used to find solution todetermine the minimum number of kanbans and othermeasures. In simulated annealing algorithm, researcherscan aim to device a

40、 better seed generation algorithm whichwill ensures better starting solution. In most of the papers,comparisons are done only based on relative improvements. Instead of this approach, comparisons based oncomplete ANOVA experiments would provide reliableinferences. This algorithm developed by Elizab

41、eth Vergara et al.[18] uses only two—point crossover genetic operators. Athird genetic operator may be introduced to further improvethe performance of the evolutionary algorithm. Theevolutionary algorithm may be modified to handle complexsupply chain problem. In JIT-SCM related researchworks, effort

42、 should be directed to develop simulation aswell as meta—heuristics to derive results under probabilisticconditions。 In the work of Sarah M. Rayan et al. [69], the applicationof single chain analysis for multiple chain operation raisesan open question whether a single WIP level should bemaintained

43、for all products or individual levels for eachproduct。 Further, most of the studies use simulation. Hence,future research shall be directed to develop improvedsearch procedures for finding WIP levels in kanbansystems. As an extension to the work of Krieg et al. [38],a decomposition algorithm can be

44、developed for multiproductkanban systems with state dependent setups。 Theadaptive approach suggested by Tardif et al. [85] may beextended for multi—stage, multi—product kanban system。The work of Lai et al。 [41] can be extended by includingmore variables and elements and conducting experimentsto inve

45、stigate the stability of the system under variousconditions such as the sudden increase in demand andrandom demand, experimenting on the system behaviour ofdifferent types of customer and modes of manufacturing.The nested partitioned method provided by Leyuan Shi andShuli Men [43] can be enhanced by

46、 incorporating any oneor a combination of the many other heuristics viz.,elaborate partitioning, sampling, backtracking scheme,simulation, etc. Then, they can be applied to combinatorialproblems of this type Ants colony optimization algorithm is a recent inclusionto the existing meta-heuristics viz

47、。, simulated annealingalgorithm, genetic algorithm and tabu search. So, aresearcher can study the solution accuracy as well asrequired computational time of this algorithm for his/herJIT problem of interest, which falls under combinatorialcategory and compare its results with the results of theother

48、 three heuristics (meta-heuristics)。 Source:C.Sendil Kumar, R。Panneerselvam, 2007.“Literature review of JIT—KANBAN system".The International Journal of Advanced Manufacturing Technology, vol.32,no。5,August.pp。393—408. 中文翻譯 JIT看板系統(tǒng)的文獻(xiàn)回顧 摘要:在本文中,通過(guò)對(duì)JIT(實(shí)時(shí))看板文獻(xiàn)的調(diào)查提交相關(guān)的報(bào)告。報(bào)告介紹部分JIT處理的理念以及概念包

49、含了推式及拉式系統(tǒng)這些內(nèi)容,同時(shí),對(duì)看板系統(tǒng)中的阻塞機(jī)制也進(jìn)行精心地討論。在后面各節(jié)中,介紹JIT看板的應(yīng)用程序和性能(MOP)在實(shí)施中的重要性.此外,文章也討論了JIT最近出現(xiàn)的“特殊情況"的現(xiàn)象。最后,本文通過(guò)對(duì)100個(gè)先進(jìn)國(guó)家的研究論文進(jìn)行調(diào)查,提出了未來(lái)的發(fā)展方向。 1 介紹 被日本稱(chēng)為實(shí)時(shí) (JIT) 制造系統(tǒng)的“豐田生產(chǎn)方式”由大野耐一開(kāi)發(fā)的。JIT制造系統(tǒng)是以不斷減少和最終清除各種各樣的廢物為主要目標(biāo)(布朗等人 [5],大野[54],蘇格莫里等人[82])。基于這一原則,日本企業(yè)保持非常低的庫(kù)存,實(shí)現(xiàn)極高的質(zhì)量和生產(chǎn)率(理查德特斯恩[62],詹姆斯H格林[30])的經(jīng)營(yíng)水平。

50、JIT強(qiáng)調(diào)“零概念”,這意味著零缺點(diǎn)、零隊(duì)列、零庫(kù)存、零故障等目標(biāo)需要實(shí)現(xiàn)。它可以在適當(dāng)?shù)奈恢煤瓦m當(dāng)?shù)臅r(shí)間,確保供應(yīng)正確數(shù)量的部件。在此基礎(chǔ)上,把重大收購(gòu),舊系統(tǒng)更改以及買(mǎi)方和賣(mài)方的關(guān)系作為新的革命理念來(lái)研究(沃馬克等,沃馬克[91],和瓊斯[92],馬凱等人[45])。同樣,JIT在工廠運(yùn)營(yíng)中成為不可避免的制造系統(tǒng),該系統(tǒng)擁有單元制造,柔性制造,計(jì)算機(jī)集成制造和機(jī)器制造(舍恩伯格[63],格蘭翰[12]). 技術(shù)的進(jìn)步以及滿足全球競(jìng)爭(zhēng)的需要,將傳統(tǒng)的推動(dòng)生產(chǎn)系統(tǒng)與物料需求計(jì)劃(MRP)結(jié)合,形成拉式JIT生產(chǎn)系統(tǒng).在那種情況下,可以對(duì)拉式制造系統(tǒng)生產(chǎn)的制品(WIP)進(jìn)行良好的管理和控制(梅

51、森保羅[46])。 看板系統(tǒng)是一個(gè)新的理念,在JIT生產(chǎn)系統(tǒng)中起著重要作用.看板基本上包含在每個(gè)生產(chǎn)階段,是一種在完成裝配中需要很多細(xì)節(jié)信息的塑料卡。同時(shí),看板系統(tǒng)也是一個(gè)需要多階段生產(chǎn)計(jì)劃和庫(kù)存控制的系統(tǒng)。這些塑料卡用來(lái)控制生產(chǎn)過(guò)程中多余的庫(kù)存.系統(tǒng)看板的使用可以提高產(chǎn)量和利用率,減少在工作過(guò)程中的生產(chǎn)時(shí)間。 本文的目標(biāo)是如下所示: (1)嚴(yán)格審查JIT文獻(xiàn) (2)在不同文章中,研究JIT的區(qū)別 (3)探討JIT看板系統(tǒng)的最新趨勢(shì)和未來(lái)研究方向 本文在精心審查和研究的基礎(chǔ)上對(duì)提出的看板進(jìn)行適當(dāng)?shù)姆诸?lèi),因?yàn)樽鳛橐环N在代理人使用它后需要進(jìn)行反饋的JIT系統(tǒng)。本文還討論看板卡,豐田公式

52、,攔截機(jī)制,如何實(shí)施看板應(yīng)用程序和性能(MOP)的措施和推拉系統(tǒng)的工作原理,也包括文章中JIT看板系統(tǒng)最新“特殊情況”的處理.最后,對(duì)未來(lái)的研究提出了方向。 6.1.1 流水作業(yè) 看板系統(tǒng)是在重復(fù)生產(chǎn)環(huán)境中廣泛實(shí)施。單卡看板業(yè)務(wù)系統(tǒng)可以分成兩個(gè)被證明具有很高效率的啟發(fā)式(薩拉德哈勃利亞達(dá)等人[77]).同時(shí),他們提出單卡看板業(yè)務(wù)系統(tǒng)與雙阻塞的遞歸方程(薩拉德哈勃利亞達(dá)等人[78]),還提出利用啟發(fā)式部分加權(quán)流量時(shí)間的總和計(jì)算最小化總加權(quán)時(shí)間。然而,他在兩個(gè)單卡流水車(chē)間做了N個(gè)啟發(fā)式部分類(lèi)型的調(diào)度工作(拉基杰萊[61])。本文針對(duì)不同的問(wèn)題,例如以盡量減少計(jì)算在加權(quán)時(shí)間早到和加權(quán)時(shí)間遲到這兩

53、種模型下的加權(quán)總和為目標(biāo)而開(kāi)發(fā)了一種啟發(fā)式算法,提交不同的數(shù)學(xué)模型報(bào)告。另外,他們也做了類(lèi)似的工作(赫馬馬利尼等人[22])。在這項(xiàng)工作中,開(kāi)發(fā)的啟發(fā)式算法被稱(chēng)為模擬退火算法。通過(guò)與其他算法的比較,在相對(duì)的基礎(chǔ)上只能得到平均增幅,而不是基于在實(shí)驗(yàn)的基礎(chǔ)上用完整的方差比較分析得出可靠的推論. 他們對(duì)兩個(gè)相鄰的計(jì)算機(jī)之間關(guān)于容量有限的緩沖區(qū)流水作業(yè)問(wèn)題進(jìn)行了研究(彼得布魯克等人[58])。在計(jì)算機(jī)上完成作業(yè)的處理后,接著,要處理在指定計(jì)算機(jī)之間的緩沖區(qū)中存儲(chǔ)的任務(wù)。如果緩沖區(qū)被完全占用,那當(dāng)前計(jì)算機(jī)上作業(yè)只有在阻止這臺(tái)機(jī)器的其它工作情況下實(shí)施。在本論文中,他們已確定一個(gè)可行的時(shí)間表,用來(lái)盡量減少

54、在最大完工時(shí)間里使用禁忌搜索.使用禁忌搜索產(chǎn)生的問(wèn)題可以通過(guò)比較基準(zhǔn)來(lái)反映結(jié)果。該比較基準(zhǔn)只是基于相對(duì)改善,而不是在實(shí)驗(yàn)的基礎(chǔ)上通過(guò)完整的方差比較分析得到可靠的推論. 6。1.2 裝配線 商店在經(jīng)營(yíng)某些部分時(shí)進(jìn)行類(lèi)似流動(dòng)裝配線組裝的排序。在有多產(chǎn)品組裝線情況下,排序工作是一項(xiàng)艱巨的任務(wù).它被認(rèn)為是一種混合模式裝配線排序問(wèn)題,也是一個(gè)組合的問(wèn)題,他們制定了這個(gè)整數(shù)規(guī)劃模型組合解決相應(yīng)的問(wèn)題(蒂萊爾等[16])。該模型只可用于解決小規(guī)模問(wèn)題,是因?yàn)橛邢嚓P(guān)處理變量的限制,這也是目前運(yùn)籌學(xué)軟件受到整數(shù)規(guī)劃模型組合的限制。然而,他們已經(jīng)考慮到類(lèi)似混流裝配線排序有輸送時(shí)停頓問(wèn)題現(xiàn)象出現(xiàn),提出了尋求最優(yōu)

55、解和次優(yōu)的混合模式排序問(wèn)題的解決方案,在總補(bǔ)時(shí)階段分別采用分支和模擬退火算法使得排序最小化(劉曉波等人[94])。分支定界算法是專(zhuān)門(mén)尋找最優(yōu)解解決小型問(wèn)題,而模擬退火法處理規(guī)模大的問(wèn)題取得了良好的次優(yōu)的解決方案。今后,規(guī)模大的問(wèn)題適用于模擬退火研究,同時(shí),還可以建立一個(gè)更好的遺傳算法。不過(guò),實(shí)際上在確定之前,學(xué)者應(yīng)該花費(fèi)相當(dāng)長(zhǎng)的時(shí)間對(duì)模擬退火算法錯(cuò)誤方法進(jìn)行跟蹤并且得出解決參數(shù)調(diào)用限度的問(wèn)題. 6。1.3 批量生產(chǎn)系統(tǒng) 在一個(gè)批次的生產(chǎn)體系中,從一種產(chǎn)品轉(zhuǎn)換到其他產(chǎn)品依賴(lài)實(shí)現(xiàn)增值的水平,不同的優(yōu)先配置計(jì)劃,合理的經(jīng)濟(jì)設(shè)置等許多因素。他認(rèn)為拉式制造系統(tǒng)可以處理產(chǎn)品多種不同類(lèi)型的問(wèn)題(塔夫艾提

56、克等[86]).在本論文中,他們制定了使用一個(gè)不同的迭代過(guò)程來(lái)計(jì)算近似每個(gè)產(chǎn)成品庫(kù)存平均水平的優(yōu)先配置計(jì)劃。還要求被假設(shè)處理的時(shí)間和設(shè)置時(shí)間是任意泊松分布的。但是,在實(shí)踐中,處理時(shí)間可能跟隨其他的分布,如正常,均勻,指數(shù)等,這些不屬于本文研究.他們討論了關(guān)于不少?gòu)S商從采購(gòu)原料,并轉(zhuǎn)換成成品的產(chǎn)品這過(guò)程中的制造系統(tǒng)問(wèn)題,估計(jì)JIT在配送系統(tǒng)中生產(chǎn)批量的大小,設(shè)計(jì)了JIT的原料供應(yīng)體系(漢等[35])。就這樣一個(gè)簡(jiǎn)單的算法被開(kāi)發(fā)用來(lái)計(jì)算原材料制造和采購(gòu)政策的批量大小. 7 JIT的集成、實(shí)施和效益 實(shí)時(shí)是一種制造理念,需要一個(gè)公司阻礙不同的時(shí)間不斷改進(jìn)。為了保證不斷改善,有必要對(duì)任何組織和相關(guān)

57、領(lǐng)域?qū)嵤㎎IT和JIT的整合。如果從檢驗(yàn)真正實(shí)踐意義上講,JIT系統(tǒng)的生產(chǎn)性能和財(cái)務(wù)表現(xiàn)一定會(huì)改善。他們重申,適當(dāng)規(guī)劃實(shí)施的JIT生產(chǎn)系統(tǒng)和一個(gè)由最高管理層的承諾是必不可少的先決條件(斯萬(wàn)森等人[83])。然而,成本效益分析是進(jìn)行研究企業(yè)財(cái)務(wù)重點(diǎn)項(xiàng)目的初步知識(shí),就像JIT系統(tǒng)的成本和時(shí)間是JIT實(shí)施的基礎(chǔ)。流水作業(yè)型的企業(yè)實(shí)施JIT,需要改善預(yù)測(cè)時(shí)間,提高時(shí)間價(jià)值(庫(kù)克等人[11])。 TPM和JIT之間實(shí)現(xiàn)全面質(zhì)量管理關(guān)系,將導(dǎo)致生產(chǎn)性能的改善(凱利比等[37]).此外,他討論了TPM,準(zhǔn)時(shí)生產(chǎn),質(zhì)量控制和FA(工廠自動(dòng)化)一體化的重要性(黃[23])。另外,他認(rèn)為T(mén)QM和TPM是實(shí)施JI

58、T生產(chǎn)系統(tǒng)的兩個(gè)支柱(今井[27]).有人提出了一種新的JIT管理系統(tǒng),這有助于管理策略轉(zhuǎn)移到管理技術(shù)(卡庫(kù)羅艾瑪薩克[32])。 他們?cè)诿绹?guó)進(jìn)行了一項(xiàng)研究,即從253家公司的財(cái)務(wù)經(jīng)營(yíng)業(yè)績(jī)的好壞程度,評(píng)價(jià)實(shí)施JIT做法影響公司的興衰(富勒頓等人[65]).他們研究用改善財(cái)務(wù)的表現(xiàn)衡量JIT可持續(xù)在生產(chǎn)系統(tǒng)中獲得回報(bào)。此外,還研究了美國(guó)95家公司實(shí)施JIT得到好處.他們的結(jié)論是實(shí)施JIT基于時(shí)間合理利用和員工的靈活性,提高該系統(tǒng)的性能質(zhì)量和降低庫(kù)存水平,由此產(chǎn)生的盈利能力提高。 8 結(jié)論 不斷的全球競(jìng)爭(zhēng)迫使許多公司減少其投入的成本,這樣的公司可以有更大的利潤(rùn)空間。在現(xiàn)實(shí)技術(shù)的進(jìn)步和解決方案

59、增多的情況下,公司把達(dá)到最大限度地降低投入成本作為目標(biāo)。JIT看板是一項(xiàng)在許多產(chǎn)業(yè)生產(chǎn)線中起到重要作用的系統(tǒng),通過(guò)盡量減少工作中的進(jìn)程和吞吐量的時(shí)間,最大限度地提高生產(chǎn)線效率。在本文中,作者嘗試在研究先進(jìn)文章的同時(shí)去探索JIT看板系統(tǒng)在該領(lǐng)域使用的先進(jìn)設(shè)備。在簡(jiǎn)要介紹推拉系統(tǒng),不同看板類(lèi)型,阻斷機(jī)制及其工作原理后,作者將JIT看板系統(tǒng)的研究文章分為五個(gè)大內(nèi)容:即實(shí)證理論,建模方法,多變性和其效果,競(jìng)爭(zhēng)的在制品和JIT供應(yīng)鏈管理。此外,作者們提供了一個(gè)JIT模式下,出現(xiàn)部分看板的特殊情況.本文將幫助研究人員對(duì)不同問(wèn)題下的JIT看板系統(tǒng)提供目前的更新發(fā)展方向,這將進(jìn)一步引導(dǎo)他們未來(lái)研究的方向。

60、對(duì)未來(lái)的研究方向介紹如下: 啟發(fā)式算法,模擬退火算法,遺傳算法和禁忌搜索可能被用來(lái)尋找解決像流水車(chē)間混合裝配屬于組合這類(lèi)問(wèn)題的最優(yōu)方案。當(dāng)需要使用模擬退火算法時(shí),研究人員也可以考慮使用遺傳算法,這將能保證解決問(wèn)題需要更好的方案。在大部份的文件中,相互間的比較僅是基于相對(duì)改善。而不是在實(shí)驗(yàn)的基礎(chǔ)上通過(guò)完整的方差比較分析得到可靠的推論。 他們開(kāi)發(fā)了這個(gè)算法,僅使用了兩個(gè)點(diǎn)的交叉遺傳算法(伊麗莎白,貝爾加拉等人[18])。后來(lái)可能引入遺傳操作,進(jìn)一步提高了遺傳算法的性能。遺傳算法在處理復(fù)雜的供應(yīng)鏈問(wèn)題可能被修改.在JIT供應(yīng)鏈管理相關(guān)的研究工作中,應(yīng)該努力在啟發(fā)式概率條件下得出開(kāi)發(fā)仿真的結(jié)果。

61、 關(guān)于單鏈分析多個(gè)連鎖經(jīng)營(yíng)提出了一個(gè)懸而未決的問(wèn)題,它是一個(gè)由單一制品水平為所有產(chǎn)品提供單位產(chǎn)品水平的問(wèn)題(薩拉米娃蒂等[69])。此外,大多數(shù)研究利用電腦模擬。因此,為了研究的發(fā)展,今后的研究方向應(yīng)是發(fā)展以及改善看板系統(tǒng)在制品搜索程序中的水平(克里格等[38])。一個(gè)分解算法可開(kāi)發(fā)多種符合計(jì)算國(guó)家相關(guān)的設(shè)置看板系統(tǒng)的產(chǎn)品的方法。該合理方法是由他所提出的(塔蒂夫等[85])。該方法可適用于擴(kuò)展到多產(chǎn)品多級(jí)看板系統(tǒng)。有人為了研究該算法的延伸性進(jìn)行并實(shí)驗(yàn),包括更多的變數(shù)和因素,如在需求和隨機(jī)需求的突然增加情況下以及在各種條件下,對(duì)不同類(lèi)型的客戶(hù)系統(tǒng)使用生產(chǎn)模式的穩(wěn)定性進(jìn)行行為試驗(yàn)(勵(lì)等[41])。

62、嵌套分區(qū)方法是由他們提供的,可以精心劃分納入任何一個(gè)或其它的許多如抽樣,回溯方案,仿真等增強(qiáng)啟發(fā)式的組合(樂(lè)苑世與趙樹(shù)理男士[43])。然后,他們可以應(yīng)用這種方法解決這種類(lèi)型的組合問(wèn)題。 螞蟻的蟻群優(yōu)化算法是最近加入到現(xiàn)有的啟發(fā)式,模擬退火算法,遺傳算法和禁忌搜索中去的。因此,研究人員可以根據(jù)自己的興趣和所需的計(jì)算時(shí)間針對(duì)JTI問(wèn)題的組合分別采取不同的算法,研究其他三種啟發(fā)式(啟發(fā)式)的結(jié)果并比較結(jié)果的準(zhǔn)確性。 出處:[印度] C。塞蒂庫(kù)馬爾,R。帕爾塞沃瑪,《JIT看板系統(tǒng)的文獻(xiàn)回顧》,先進(jìn)制造技術(shù)國(guó)際雜志,第32卷(5),2007(8):393-408。翻譯部分為摘要、第一、六、七節(jié)。

展開(kāi)閱讀全文
溫馨提示:
1: 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
2: 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶(hù)所有。
3.本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
5. 裝配圖網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶(hù)上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶(hù)因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

相關(guān)資源

更多
正為您匹配相似的精品文檔
關(guān)于我們 - 網(wǎng)站聲明 - 網(wǎng)站地圖 - 資源地圖 - 友情鏈接 - 網(wǎng)站客服 - 聯(lián)系我們

copyright@ 2023-2025  zhuangpeitu.com 裝配圖網(wǎng)版權(quán)所有   聯(lián)系電話:18123376007

備案號(hào):ICP2024067431號(hào)-1 川公網(wǎng)安備51140202000466號(hào)


本站為文檔C2C交易模式,即用戶(hù)上傳的文檔直接被用戶(hù)下載,本站只是中間服務(wù)平臺(tái),本站所有文檔下載所得的收益歸上傳人(含作者)所有。裝配圖網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶(hù)上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)上載內(nèi)容本身不做任何修改或編輯。若文檔所含內(nèi)容侵犯了您的版權(quán)或隱私,請(qǐng)立即通知裝配圖網(wǎng),我們立即給予刪除!