Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound

Article Abstract:

A stochastic branch-and-bound technique was proposed for stochastic single-machine-tardiness problems with job weights. The proposed technique depends on partitioning the solution space and estimating upper and lower bounds by sampling. Computational experiments reveal that it can also be utilized for problem cases with a relatively small number of jobs. The technique can only generate approximate solutions for a larger number of jobs because of the problem's enormous complexity.

Operations Research, Research, Scheduling (Management), Stochastic programming

---

A branch-and-bound algorithm for the location of facilities causing atmospheric pollution

Article Abstract:

Nonlinear locational models for obnoxious facilities that cause atmospheric pollution is introduced. They can be used to provide a regional basis for determining the best location for obnoxious facilities as well as a national basis for location optimization planning. Two model types are described, the MAXIMIN and the MINISUM. Wind and other meterorological conditions are considered in the models that conducts a branch-and-bound geometrical search for the optimal locations.

Environmental aspects, Location, Industrial buildings, Industrial locations, Industrial location

---

Using short-term memory to minimize the weighted number of late jobs on a single machine

Article Abstract:

The problem of minimizing the weighted number of late jobs on a single-machine with release dates is investigated. A branch-and-bound algorithm using short-term memory approach is presented and computational experiments on problems with up to100 jobs are reported.

Mathematics problems

Similar abstracts:

• Abstracts: An algorithm for single shift scheduling of hierarchical workforce. Using intelligent agents for pro-active, real-time urban intersection control
• Abstracts: The special talents women bring to participative management
• Abstracts: A practical heuristic for a large scale vehicle routing problem. Postoptimizing equilibrium flows on large scale networks
• Abstracts: On the optimal entropy analysis. Optimal Bayesian sampling acceptance plan with random censoring. The robust coloring problem
• Abstracts: Business, science and environmental politics: toward a political economy of hope. Market innovation and the global environment

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.