1,720,971 research outputs found
A 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
A Heuristic Relief Transportation Planning Algorithm for Emergency Supply Chain Management
No full textPerformance evaluation with the entropy-based weighted Russell measure in data envelopment analysis
No full textA Heuristic Relief Transportation Planning Algorithm for Emergency Supply Chain Management
No full text
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
