freepeople性欧美熟妇, 色戒完整版无删减158分钟hd, 无码精品国产vα在线观看DVD, 丰满少妇伦精品无码专区在线观看,艾栗栗与纹身男宾馆3p50分钟,国产AV片在线观看,黑人与美女高潮,18岁女RAPPERDISSSUBS,国产手机在机看影片

正文內(nèi)容

生產(chǎn)線平衡外文翻譯--對于e類型的簡單生產(chǎn)線平衡問題的解決過程中文-其他專業(yè)-資料下載頁

2025-01-19 03:26本頁面

【導(dǎo)讀】工業(yè)工程與管理,中華人民共和國,臺灣省,高雄市,有最少的變量,約束和計(jì)算時(shí)間。且研究了生產(chǎn)線平衡問題。后一年,Salverson建立了第一個(gè)生產(chǎn)線平衡的數(shù)學(xué)模。在隨后的幾年,生產(chǎn)線平衡成為了一個(gè)流行的主題,Kim,問題Ⅱ是兩種基本的優(yōu)化問題。配到不同的工作站。效用工作最小化,總生產(chǎn)速率變化最小化、總過程成本最小化。目標(biāo)包括周期、工作站數(shù)目、工作站數(shù)目的面積等。為了解決混合模型裝配線平衡問題,Erel和Gökçen對混合模。和解決俠侶增長的約束條件。Kim和Jeong使用包含依賴于序列的準(zhǔn)備時(shí)。間的運(yùn)輸系統(tǒng)解決了混合模型裝配線平衡中工作輸入隊(duì)列的優(yōu)化問題。大多數(shù)研究都只關(guān)注SALBP-1的解,而不是關(guān)注SALBP-2的解,這是因?yàn)?。SALBP-2,然后將結(jié)果與已存在的解決方案進(jìn)行比較。在這個(gè)問題中,決策者必須同時(shí)考慮幾個(gè)沖突的目標(biāo)。標(biāo)微分進(jìn)化法又提出了一個(gè)新的啟發(fā)式算法來解決SALBP-2。期為目的來處理分配到的任務(wù)。行寬度可以用來提升現(xiàn)存的禁忌搜索程序以解決裝配線問題,Levitin,Rubinovitz,

  

【正文】 Engineering, 53,206–214. [21] Kim, Y. K., Kim, Y. J., amp。 Kim, Y. (1996). Geic algorithms for assembly line balancing with various objectives. Computers and Industrial Engineering,30(3),397–409. [22] Klein, R., amp。 Scholl, A. (1996). Maximizing the production rate in simple assembly line balancing – A branch and bound procedure. European Journal of Operational Research, 91, 367–385. [23] Levitin, G., Rubinovitz, J., amp。 Shnits, B. (2021). A geic algorithm for robotic assembly line balancing. European Journal of Operational Research, 168(8),811–825. [24] McGovern, S. M., amp。 Gupta, S. M. (2021). A balancing method and geic algorithm for disassembly line balancing. European Journal of Operational Research, 179(3),692–708. [25] Nearchou, A. C. (2021). Balancing large assembly lines by a new heuristic based on differential evolution method. International Journal of Advanced Manufacturing Technology, 34, 1016–1029. [26] Nearchou, A. C. (2021). Multiobjective balancing of assembly lines by population heuristics. International Journal of Production Research, 46, 2275–2297. [27] 214。zcan, U., amp。 Toklu, B. (2021). Balancing of mixedmodel twosided assembly amp。 Industrial Engineering, 57, 217–227. [28] Pastor, R., Corominas, A., amp。 Lusa, A. (2021). Different ways of modeling and solving precedence and inpatibility constraints in the assembly line balancing problem. Frontiers in Arti?cial Intelligence and Applications, 113, 359–366. [29] RahimiVahed, A., amp。 Mirzaei, A. H. (2021). A hybrid multiobjective shuf?ed frogleaping algorithm for a mixedmodel assembly line sequencing problem. Computers amp。 Industrial Engineering, 53, 642–666. [30] Sabuncuoglu, I., Erel, E., amp。 Alp, A. (2021). Ant colony optimization for the single model Utype assembly line balancing problem. International Journal of Production Economics, 120, 287–300. [31] Sabuncuoglu, I., Erel, E., amp。 Tayner, M. (2021). Assembly line balancing using 18 geic algorithm. Journal of Intelligent Manufacturing, 11, 295–310. [32] Saeid, M., amp。 Anwar, I. (1997). Multicriteria assembly sequencing. Computers amp。Industrial Engineering, 32(4), 743–751. [33] Salverson, M. E. (1955). The assembly line balancing problem. Journal of IndustrialEngineering, 6, 18–25. [34] Scholl, A. (1999). Balancing and sequencing of assembly lines. Heidelberg: PhysicaVerlag. ch. 2. [35] Scholl, A., amp。 Becker, C. (2021). A note on an exact method for costoriented assemblyline balancing. International Journal of Production Economics,97,343–352. [36] Scholl, A., Boysen, N., Fliedner, M., Klein, R. (1995). Homepage for assembly line optimization research, [37] Scholl, A., amp。 Klein, R. (1997). SALOME: A bidirectional branchandbound procedure for assembly line balancing. Journal on Computing, 9, 319–334. [38] Scholl, A., amp。 Klein, R. (1999). Balancing assembly lines effectively – A putational parison. European Journal of Operational Research, 114, 50–58. [39] Simaria, A. S., amp。 Vilarinho, P. M. (2021). 2ANTBAL An ant colony optimization algorithm for balancing twosided assembly lines. Computers amp。 Industrial Engineering, 56, 489–506. [40] Suresh, G., amp。 Sahu, S. (1994). Stochastic assembly line balancing using simulated annealing. International Journal of Production Research, 32, 1801–1810. [41] Talbot, F. B., amp。 Patterson, J. H. (1984). An integer programming algorithm with work cuts for solving the assembly line balancing problem. Management [42] Science, 30, 85–99. [43] Tasan, S. O., amp。 Tunali, S. (2021). A review of the current applications of generic algorithms in assembly line balancing. Journal of Intelligent Manufacturing, 19,49– line balancing problems with a learning effect. Applied MathematicalModeling, 32, 2954–2961. [44] Yeh, D. H., amp。 Kao, H. H. (2021). A new bidirectional heuristic for the assembly line balancing problem. Computers amp。 Industrial Engineering, 57, 1155–1160.
點(diǎn)擊復(fù)制文檔內(nèi)容
環(huán)評公示相關(guān)推薦
文庫吧 www.dybbs8.com
備案圖鄂ICP備17016276號-1