| Summary: | 碩士 === 中國文化大學 === 機械工程學系數位機電碩士班 === 101 === Nowadays, RFID (Radio Frequency Identification) tags are applied in many industries. An RFID tag attached to an automobile during production can be used to track its progress through the assembly line. Pharmaceuticals can be tracked through warehouses. Livestock and pets may have tags injected, allowing positive identification of the animal. Since RFID tags can be attached to clothing, possessions, or even implanted within people, the possibility of reading personally-linked information without consent has raised privacy concerns [2]. In this paper, I will introduce to RFID technology that is used in drug factory. So, it will make to increase patient safety by improving traceability, and certifying the pedigree of pharmaceutical products as they move from the manufacturer to the customers (wholesalers, pharmacies, hospitals…). It also provides consumers with the right products at the right time, with more choices and better service. The main purpose of this paper is the study of using Bigdata and RFID technology to solve drug selling problem (DSP) from ordering, assignment in factory, and manufacturing to transportation. So that all customers are supplied enough and total transport and manufacturing costs are minimal. This paper introduces 9 methods can be used to solve DSP is (1) Northwest corner method (2) Minimum cost method (3) Vogel’s approximation method (4) Row minimum Method (5) Column minimum Method (6) Russell’s approximation method (7) Complete enumeration method (8) Simplex method (9) Hungarian assignment method. After reviewing the main literature in this area, Mathematical model of the DSP, Bigdata, this paper presents some examples is solved by six methods. This paper introduces some methods to improve the results from the methods that gave suboptimal results. Those methods are (1) Stepping stone method (2) Modified distribution method. Finally, the paper compares some methods and proposes a comparison table to know which methods in different situation is the best. At assignment section, Hungarian assignment method gives the best result. At transportation section, the table shows that most results of Vogel’s approximation method and Russell’s approximation method give optimal results, so they are the best methods.
|
|---|
