• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 172
  • 40
  • 22
  • 20
  • 8
  • 5
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 323
  • 323
  • 120
  • 61
  • 53
  • 44
  • 37
  • 37
  • 37
  • 36
  • 35
  • 33
  • 32
  • 30
  • 29
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Stochastic programming applied to reservoir operations

Sharda, Ramesh. January 1981 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1981. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 91-95).

Stochastic vehicle routing problems with random travel times /

Kenyon, Astrid Sandrine, January 1998 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 167-194). Available also in a digital version from Dissertation Abstracts.

Optimizing loblolly pine management with stochastic dynamic programming /

Häring, Thomas W., January 1993 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 224-238). Also available via the Internet.

Single- and multiple-objective stochastic programming models with applications to aerodynamics

Croicu, Ana-Maria. Hussaini, M. Yousuff. January 2005 (has links)
Thesis (Ph. D.)--Florida State University, 2005. / Advisor: M. Yousuff Hussaini, Florida State University, College of Arts and Sciences, Dept. of Mathematics. Title and description from dissertation home page (viewed Jan. 25, 2006). Document formatted into pages; contains xii, 178 pages. Includes bibliographical references.

Monte Carlo sampling-based methods in stochastic programming

Bayraksan, Güzin, Morton, David P., January 2005 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisor: David P. Morton. Vita. Includes bibliographical references.

Finitely convergent methods for solving stochastic linear programming and stochastic network flow problems

Qi, Liqun. January 1984 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 126-128).

Monte Carlo methods for multi-stage stochastic programs

Chiralaksanakul, Anukal. January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.

Task Optimization and Workforce Scheduling

Shateri, Mahsa 31 August 2011 (has links)
This thesis focuses on task sequencing and manpower scheduling to develop robust schedules for an aircraft manufacturer. The production of an aircraft goes through a series of multiple workstations, each consisting of a large number of interactive tasks and a limited number of working zones. The duration of each task varies from operator to operator, because most operations are performed manually. These factors limit the ability of managers to balance, optimize, and change the statement of work in each workstation. In addition, engineers spend considerable amount of time to manually develop schedules that may be incompatible with the changes in the production rate. To address the above problems, the current state of work centers are first analyzed. Then, several deterministic mathematical programming models are developed to minimize the total production labour cost for a target cycle time. The mathematical models seek to find optimal schedules by eliminating and/or considering the effect of overtime on the production cost. The resulting schedules decrease the required number of operators by 16% and reduce production cycle time of work centers by 53% to 67%. Using these models, the time needed to develop a schedule is reduced from 36 days to less than a day. To handle the stochasticity of the task durations, a two-stage stochastic programming model is developed to minimize the total production labour cost and to find the number of operators that are able to work under every scenario. The solution of the two-stage stochastic programming model finds the same number of operators as that of the deterministic models, but reduces the time to adjust production schedules by 88%.

Portfolio optimization using stochastic programming with market trend forecast

Yang, Yutian, active 21st century 02 October 2014 (has links)
This report discusses a multi-stage stochastic programming model that maximizes expected ending time profit assuming investors can forecast a bull or bear market trend. If an investor can always predict the market trend correctly and pick the optimal stochastic strategy that matches the real market trend, intuitively his return will beat the market performance. For investors with different levels of prediction accuracy, our analytical results support their decision of selecting the highest return strategy. Real stock prices of 154 stocks on 73 trading days are collected. The computational results verify that accurate prediction helps to exceed market return while portfolio profit drops if investors partially predict or forecast incorrectly part of the time. A sensitivity analysis shows how risk control requirements affect the investor's decision on selecting stochastic strategies under the same prediction accuracy. / text

Stochastic network interdiction: models and methods

Pan, Feng 28 August 2008 (has links)
Not available / text

Page generated in 0.1531 seconds