none

In wired network, there are many researches about scheduling algorithm. As for wireless network, the scheduling algorithm is not maturer than wired network. And there are some following characteristics of wireless network that we can not make use of wired scheduling algorithm directly:(1)Less bandwidth in wireless network;(2)Location dependent errors;(3)Higher error rate and bursty error. So when we design the wireless scheduling algorithm, there are some important issues we should take into account¡G (1)Fairness ; (2)QOS ; (3)Whether the overall throughput rises or not; (4)Whether the bandwidth is best utilized or not In this paper, we introduce the wired and wireless scheduling algorithm separately and discuss the advantage and disadvantage of these methods first. And we propose a scheduling algorithm which is based on WFQ [1] and dynamically adjusts weights according to the error rate of each flow. In this method, the base station will allocate the bandwidth by calculating the weight of mobile hosts and the proportion of error rates to the whole body. And during the process of adjusting, we will prevent the weight of a certain channel from increasing or decreasing excessively which might lead to unfair phenomenon. Under this adjustment, we will raise the whole throughput and maintain the fairness of all users.

In ordert to increasing the capacity of stocking and integration in the process of optimizing the internal cost in steel industry. The cost of material profolio is usually being ignored during opmization. Experiences-based decision paten still being carried out in material profolio in this industry.Thus the Inventory and Manufacture cost are losing inadvertently. This study aims at obtaining the minimum material profolio cost so that we provide a model concerned with cost and element limitation of target product.Using dynamic programming into material-profolio decision making process. We divided material profolio into three steps, transforming the productive limitations into mathematic constrains,and implememting by software.The real-case data is given to estabilish the model database.Comparing our data with the real data,we found that with the approach, we significately reduced and the cost and variety of material profolio in different critiria

Baker [9] defines scheduling as the problem of allocating scarce resources to activities over time1. In<br />this manuscript, we consider several scheduling problems with a variety of different environments.<br />The two parts of this manuscript provide an overview of two of our major research interests. The first<br />part (Chapters 2 to 5) is dedicated to polynomial time solutions of equal{processing{time scheduling<br />problems. The second one (Chapters 7 to 15) deals with the application of Constraint Programming<br />to scheduling. These two parts re<br />ect the balance we have tried to keep between theoretical and<br />more applied research.<br />Although all the topics covered in this manuscript are related to scheduling, Parts 1 and 2 are<br />dedicated to very different aspects of scheduling. Some few results discussed in Part 1 are occasionally<br />used in Part 2 but they are independent one from another. In the following, we brie<br />y review the<br />content Parts 1 and 2. More detailed introductions are provided in Sections 1 and 7 respectively.

Thesis (M. Phil.)--University of Hong Kong, 2009. / Includes bibliographical references. Also available online.

Thesis (PhD) - Swinburne University of Technology, Faculty of Engineering and Industrial Sciences, Centre for Complex Software Systems and Services, 2009. / A thesis submitted to CS3 - Centre for Complex Software Systems and Services, Faculty of Engineering and Industrial Sciences, Swinburne University of Technology for the degree of Doctor of Philosophy, 2009. Typescript. "June 2009". Bibliography: p. 122-135.

Thesis (Ph. D.)--School of Electrical and Computer Engineering, Georgia Institute of Technology, 2004. Directed by Yorai Wardi. / Vita. Includes bibliographical references (leaves 161-164).

Thesis--PlanB (M.S.)--University of Wisconsin--Stout, 2003. / Includes bibliographical references.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 283-288). Available also in a digital version from Dissertation Abstracts.

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 59-61). Also available in electronic version. Access restricted to campus users.