5,279 research outputs found
Letter from Frank Chin
No full textA letter from Frank Chin arguing that their should be a day name after Japanese American activist James Omura, and describing the kind of celebration that should take place in his honor. The day Chin proposes in November 27th, Omura's birthday.These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
Letter from [Frank] Chin to Paul [Tsuneishi], December 23, 1997
No full textA letter to Paul [Tsuneishi] from [Frank] Chin about planning the speakers and the media outreach for "Michi Day," the event to celebrate author Michi Weglyn and her book "Years of Infamy."These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
Performance evaluation with the entropy-based weighted Russell measure in data envelopment analysis
No full textA Heuristic Master Planning Algorithm with Multiple Objectives and Component Commonality
No full text本研究針對包含多個最終成品的供應鏈網路圖形，且多個最終產品之間有共用性物料的使用。
本演算法具有兩個主要目標(1).在考慮成品之產品架構、以及有限產能限制下，規劃與安排未來所
有的訂單，選擇適當時間交由適當的廠商生產，希望達到最小生產與運送成本，以及最少訂單的延
遲交貨時間，達到供應鏈最佳化的效果。(2).在考慮共用性物料的使用下，針對共用性資源的分配
提出考慮公平性的做法。本研究的方法主要分為五大步驟，首先將具有不同生產程序之節點分離，
執行產能初始化，第二步驟則是將所有產能轉換為以最終產品為產能單位。第三步驟，根據使用者
需求選擇適合訂單排序方式與參數，第四步驟，根據訂單所要求之最終產品從網路結構中取出有效
的子網路，第五步驟,再經過訂單排序後便可執行核心的三大演算法，貪婪演算法、平均分配演算法、
以及比例分配演算法，每筆訂單依序規劃排程。在對每一張訂單規劃排程時，找出最小成本之廠商
組合，然後尋找與安排適當生產量，當此廠商組合無法滿足需求時，調整供應鏈網路圖形以尋找次
佳之廠商組合，不斷重複上述步驟直到訂單需求滿足或供應鏈已無任何產能幫助生產為止。當交貨
時距限制下需求仍未滿足，延遲一個交貨時距，重複上述之方法，直到訂單需求完全滿足為止。至
於產能分配的方式，貪婪演算法會依序將每一張訂單的需求滿足為止；平均分配演算法會將所有會
使用同一期同一資源的訂單需求作一個平均的產能分配。最後，比例分配演算法會將所有會使用同
一期同一資源的訂單需求依據需求比例分配。This study proposes a heuristic algorithm to solve a general master-planning problem of a supply chain
network with multiple final products. The objectives of this planning algorithm are: (1)To minimize the
processing, transportation , and inventory costs under the constraints of the capacity limits of all the nodes
in a given supply chain network graph and the quantity and due day requirements of all the orders; (2)To
lower the impact of fairness problem of greedy capacity allocation. This study assumed that multi-finished
items are made and shipped on the given supply chain which results in common parts on common nodes
for different finished items. Three different ways are proposed to solve the sharing capacity problem
caused by common components: greedy, average capacity, and proportional capacity. All the three
algorithms are composed of five steps: (1) Split nodes in the supply chain network graph by different
functions the nodes perform, and set the initial capacities of all nodes; (2) Transform the capacity units
shown on the graph, based on the unit of the final finished product; (3) Sort all the orders by adopting a
rule-based sorting method to decide the scheduling sequence; (4) Extract sub-networks from original
networks according to final product structure of orders; (5) Finally, for each order, find a minimum cost
production tree under the constraints of the order’s due date. Then, compute the maximum available
capacity of this combination and arrange the suitable quantities of production and transportation. If the
demand cannot be fulfilled before the due date, the order will have to be postponed. Repeating the process
above until the demand is completely fulfilled. The differences among three different ways of sharing
capacities lie on the quota they can allocate for each order: original capacity, average capacity and
proportional capacity. These three algorithms result in the same optimal solution as the one by “Linear
Programming” in eight different dimensions of scenarios when no delayed orders present. In the four cases
with delayed orders, the three orders will still work out a near-optimum solution in a shorter time
Letter from [Frank] Chin to David
No full textA letter from [Frank] Chin to David about buying space for a classified ad in the New York Times Sunday Book Review, that will mention the tribute to Michi Weglyn in February of 1998. The purpose of the ad is to solicit "photos and artifacts depicting the different phases of Michi's life." Chin writes that the materials will be used in"Yosh Kurimoya's Michi Show" at the event.These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
Letter from Frank Chin to Dale [Minami], December 7, 1997
No full textA letter from Frank Chin to Dale [Minami] thanking him for sending a VHS clip for "Michi Day." Chin devotes the bulk of the letter to a proposal for creating a bell, that would be made of pieces of metal from incarceration camps, to celebrate Japanese American redress.These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
Letter from [Frank Chin] to Momo and Lawson, January 21, 1998
No full textA letter to Momo and Lawson, possibly from Frank Chin, about a performance of the story Kaguya Hime, princess of the moon in Japanese folklore. The purpose of the performance is to drum up interest for the children's storytelling event that would be part of the tribute to Michi Weglyn on February 21, 1998.These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
A Heuristic Relief Transportation Planning Algorithm for Emergency Supply Chain Management
No full textLetter from Michi Weglyn to Frank Chin
No full textA letter from Michi Weglyn to Frank Chin about another letter written by Lilian Baker, a conservative author who denied that Japanese American incarceration had taken place during World War II.These materials are from box 73 and 74 of the Frank Chin Papers. The Frank Chin Papers contain personal and professional correspondence between Frank Chin and Michi Weglyn relating to particular projects on which either author was working as well as files related to the Day of Remembrance Tribute to Michi Weglyn
A Heuristic Relief Transportation Planning Algorithm for Emergency Supply Chain Management
No full text- …
