skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Stochastic rollout and justification to solve the resource-constrained project scheduling problem.

Abstract

No abstract prepared.

Authors:
;  [1]; ;  [1]
  1. (Cornell University, Ithaca, NY)
Publication Date:
Research Org.:
Sandia National Laboratories
Sponsoring Org.:
USDOE
OSTI Identifier:
903155
Report Number(s):
SAND2007-1900C
TRN: US200719%%498
DOE Contract Number:
AC04-94AL85000
Resource Type:
Conference
Resource Relation:
Conference: Proposed for presentation at the 2007 Winter Simulation Conference held December 9-12, 2007 in Washington, DC.
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; STOCHASTIC PROCESSES; RESOURCES; SCHEDULES

Citation Formats

Bernstein, Orr, Nozick, Linda Karen, Jones, Dean A., and Xu, Ning. Stochastic rollout and justification to solve the resource-constrained project scheduling problem.. United States: N. p., 2007. Web.
Bernstein, Orr, Nozick, Linda Karen, Jones, Dean A., & Xu, Ning. Stochastic rollout and justification to solve the resource-constrained project scheduling problem.. United States.
Bernstein, Orr, Nozick, Linda Karen, Jones, Dean A., and Xu, Ning. Thu . "Stochastic rollout and justification to solve the resource-constrained project scheduling problem.". United States. doi:.
@article{osti_903155,
title = {Stochastic rollout and justification to solve the resource-constrained project scheduling problem.},
author = {Bernstein, Orr and Nozick, Linda Karen and Jones, Dean A. and Xu, Ning},
abstractNote = {No abstract prepared.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Mar 01 00:00:00 EST 2007},
month = {Thu Mar 01 00:00:00 EST 2007}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less
  • We address the problem of scheduling n jobs in a flow shop environment that consists of a batching machine with capacity c and a standard machine with capacity 1 such that total completion time is minimized. We formulate this problem as a pidgin integer programming problem by using the concept of position dependent completion times; to this formulation we apply Lagrangian relaxation to obtain a strong lower bound. We show that this lower bound dominates the bound that was obtained by Ahmadi et al. by applying Lagrangian relaxation to an ordinary formulation of this problem.
  • Several Federal and Washington State Environmental Laws apply to operations and facilities associated with the N Reactor. In order to comply with these regulations, it has been decided to use a scheduling technique similar to the Integrated Living Schedule approach promoted by the NRC. The unique quality about the method described in this report is the use of weighted averaging to establish priorities for resource scheduling.
  • A mathematical model of the resource-constrained scheduling problem is presented. An algorithmic-interactive procedure for solving the problem is developed because the combinatorics of the mathematical model prevent an analytical solution. The procedure is shown to be a viable technique when applied to a scheduling and resource allocation problem at Lawrence Livermore Laboratory. 2 figures.
  • This paper presents a new methodology for maintenance scheduling that takes into account inter-area transfer limitations and stochastic reliability constraints. The optimization model is based on the Benders decomposition technique. The objective of this model is to determine a minimum cost maintenance schedule, subject to technological and system reliability constraints. The model may be used also to assess the adequacy of existing transmission limits under a given set of planned outages of generating units. Case studies with a realistic three-area power system are presented and discussed.