東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Modeling product variety induced man...

University of Michigan.

Linked to FindBook

Google Book

Amazon

博客來

Modeling product variety induced manufacturing complexity for assembly system design.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Modeling product variety induced manufacturing complexity for assembly system design./
Author:	Zhu, Xiaowei.
Description:	77 p.
Notes:	Advisers: Shixin Jack Hu; Yoram Koren.
Contained By:	Dissertation Abstracts International70-04B.
Subject:	Engineering, Industrial. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3354252
ISBN:	9781109120585

Modeling product variety induced manufacturing complexity for assembly system design.
Zhu, Xiaowei.

Modeling product variety induced manufacturing complexity for assembly system design. - 77 p.

Advisers: Shixin Jack Hu; Yoram Koren.

Thesis (Ph.D.)--University of Michigan, 2009.

The results of the research are highly applicable to all manufacturers who are interested in economically offering product variety without loss of quality and productivity.

ISBN: 9781109120585Subjects--Topical Terms:

626639
Engineering, Industrial.

Modeling product variety induced manufacturing complexity for assembly system design.
LDR:03445nmm 2200337 a 45 001 874360
005 20100824
008 100824s2009 ||||||||||||||||| ||eng d
020 $a 9781109120585
035 $a (UMI)AAI3354252
035 $a AAI3354252
040 $a UMI $c UMI
100 1 $a Zhu, Xiaowei. $3 1043626
245 1 0 $a Modeling product variety induced manufacturing complexity for assembly system design.
300 $a 77 p.
500 $a Advisers: Shixin Jack Hu; Yoram Koren.
500 $a Source: Dissertation Abstracts International, Volume: 70-04, Section: B, page: 2547.
502 $a Thesis (Ph.D.)--University of Michigan, 2009.
520 $a The results of the research are highly applicable to all manufacturers who are interested in economically offering product variety without loss of quality and productivity.
520 $a Mixed-model assembly systems have been recognized as a major enabler to handle product variety. However, the assembly process can become quite complex as the variety increases. The complexity may impact the system performance in terms of quality and productivity. This dissertation considers the variety induced manufacturing complexity in manual, mixed-model assembly lines, develops models for the propagation of complexity, and applies the models to assembly system design. A complexity measure called "Operator Choice Complexity" (OCC) is proposed to quantify human performance in making choices. The OCC is an entropy measure of the average randomness in a choice process. Meanwhile, empirical evidences support the proposed complexity measure. Based on the OCC, models are developed to evaluate the complexity at each station, and for the entire assembly system. The system level model, termed "Stream of Complexity" (SoC) model, addresses complexity propagation in multi-stage systems. By applying the SoC model, complexity can be mitigated with system design and operation decisions. The models are then applied to assembly sequence planning and build sequence scheduling.
520 $a Assembly sequence planning is to determine the order of assembly tasks. According to the SoC model, assembly sequence determines the directions of complexity flows. Thus proper sequence planning can reduce complexity. However, due to the difficulty of handling the directions of complexity flows in optimization, a transformed network flow model is formulated and solved based on dynamic programming.
520 $a Build sequence scheduling is to determine the order of products being built. It also determines the sequential dependencies between the choices. According to the complexity model, the knowledge of the sequential dependencies can help operators make choices, and scheduling proper build sequences can reduce complexity. However, deterministic models are not sufficient to study such sequence scheduling problems. A probabilistic model based on hidden Markov chains is proposed to formulate the scheduling problem with constraints. Analytical solutions are obtained, and suggest that proportional production attains the maximum complexity while batch production attains the minimum.
590 $a School code: 0127.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Engineering, Mechanical. $3 783786
650 4 $a Engineering, System Science. $3 1018128
690 $a 0546
690 $a 0548
690 $a 0790
710 2 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 70-04B.
790 $a 0127
790 1 0 $a Hu, Shixin Jack, $e advisor
790 1 0 $a Koren, Yoram, $e advisor
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3354252