Contents
Academic literature on the topic '多目標規劃'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '多目標規劃.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "多目標規劃"
LI, Chunxiao, and Shihui CHEN. "Implementation of Curriculum Planning on Inclusive Physical Education in Primary Schools in Hong Kong." Asian Journal of Physical Education & Recreation 17, no. 2 (December 1, 2011): 57–65. http://dx.doi.org/10.24112/ajper.171877.
Full textENGELHARDT, H. Tristram. "走向中國生命倫理學——重審後基礎之醫學道德." International Journal of Chinese & Comparative Philosophy of Medicine 10, no. 1 (January 1, 2012): 11–27. http://dx.doi.org/10.24112/ijccpm.101510.
Full textVinogradova, Veronika. "Capital markets and performance of strategic corporate M&A – an investigation of value drivers." European Journal of Management and Business Economics ahead-of-print, ahead-of-print (April 7, 2021). http://dx.doi.org/10.1108/ejmbe-06-2020-0168.
Full textDissertations / Theses on the topic "多目標規劃"
許宏敏 and Hong-Min Xu. "二氧化碳排放減量措施對台灣產業經濟之影響--模糊多目標規劃分析." 碩士, 東吳大學, 1985. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22085SCU04389001%22.&searchmode=basic.
Full textZHANG, ZHI, and 張治. "多目標巡迴售貨員問題之規劃." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/73210397013475362235.
Full textGAO, WEN-DE, and 高文德. "多目標規劃的ε-容度最佳化問題." Thesis, 1987. http://ndltd.ncl.edu.tw/handle/61884679454739069187.
Full text周峰正. "螞蟻理論於多目標線性規劃之研究." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/64385263715009134971.
Full textWang, Chia-Hung, and 王嘉宏. "數位網路上多重目標規劃的數學模式." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/09259597032597853491.
Full text國立政治大學
應用數學研究所
92
We present an approach for the fair resource allocation problem and QoS routing in All-IP networks that offer multiple services to users. The objective of the optimization problem is to determine the amount of required bandwidth for each link and each class to maximize the sum of the users'' utility. In this work, we focus on approaches that, while allocating bandwidth, attempt to provide a proportionally fair treatment of all the competing classes. First, we will show that an achievement function can map different criteria subject to various utility onto a normalized scale. It may be interpreted as a measure of QoS (Quality of Service) on All-IP networks. Using the bandwidth allocation model, we can find a Pareto optimal allocation of bandwidth on the network under a limited available budget. This allocation can provide the so-called proportional fairness to every class, that is, this allocation can provide the similar satisfaction to each user. Next, we present a routing scheme under consideration of the delay. Such an optimal path provides the end-to-end QoS guarantees to each user. Finally, a numerical example is given to illustrate how to solve the fair resource allocation problem and how to modify the nonlinear parts.
Hsieh, Jur-Shung, and 謝志祥. "供應鏈管理之多目標主規劃排程演算法." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/89907054865295793993.
Full text國立臺灣大學
資訊管理研究所
91
This study focuses on the master planning of “Advanced planning and scheduling.” By considering a final product and its relationship with the global supply chain structure, the objective is to minimize the sum of production cost, processing cost, transportation cost and inventory holding cost under the constraints of limited capacities and due time requirements of orders. This planning problem, formulated as a basic model, is extended into two kinds of multiple-goal optimization problems for production planning in this study. In one extension, the extra capacities for some production nodes are allowed. With this extension, an additional objective to minimize the total amounts of extra capacities used is added into the original problem. In the other extension, the delays of orders are allowed but minimized in the added objective. In the previous study, “Linear Programming,” “Mixed Integer Linear Programming” and “Goal Programming” are some popular used to solve these kinds of problems related to supply chain management. However, with the increasing complexities of the supply chain related problems, the numbers of variables and constraints in the LP models grow rapidly. It takes a lot of computer time to solve these problems if there are feasible. Nevertheless, if the LP models result to no feasible solutions, the cause of infeasible can not be identified. Therefore, this study proposes a heuristic algorithm that is more informative and flexible then LP to solve supply chain related problems. The heuristic algorithm can indicate the status of orders and allocations of capacities and searches out feasible solutions more quickly. The heuristic algorithm first prepares the information for the supply chain by scaling the information of capacities and costs based on the unit of a final product. It then sorts all the orders to determine the sequence for planning. Finally, the orders are to be planned and scheduled one-by-one in sequence. The production plan for each order may be scheduled more than once. In each time, a minimum unit cost production tree is found at first. Following that, the available capacity of the production tree is determined. If there is no more capacity available, the supply chain network structure will be adjusted. If the cost of the schedule is larger than the one for the minimum unit cost production tree, the costs of the supply chain network will be modified and a new production tree will be found. Otherwise, the capacity of production and transportation at each node in the production tree will be allocated for this specific order. The algorithm will repeat these steps until all the orders are fulfilled. In the extension related to extra capacities, the heuristic algorithm adjusts supply chain structure by treating the nodes with extra capacities as two kinds of nodes: one physical node with regular capacity and one virtual node with extra capacity. In the extension related to order delays, the heuristic algorithm compares the schedules when order is delayed with the schedule when order is not delayed, and chooses the schedule with the lowest cost including the delay cost and the sum of the other costs.
許懿允. "交談式多目標規劃求解多品質特性之產品穩健設計." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/55349797783328505307.
Full textDAI, GUANG-ZHENG, and 戴光政. "台灣電力經濟多目標規劃模型之建立與應用." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/41484643580587147308.
Full textSHEN, SHENG-YUAN, and 申生元. "多目標線性規劃於電腦輔助群體決策的應用." Thesis, 1987. http://ndltd.ncl.edu.tw/handle/10531096204212361875.
Full textWU, ZONG-MING, and 吳宗銘. "企業人力規劃之研究:多目標決策模型之應用." Thesis, 1987. http://ndltd.ncl.edu.tw/handle/54473177999179402001.
Full text