- 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.
Search results
Showing 131 to 140 of 18608 (0.072 seconds)| 131 |
Genetic studies of food intake and energy metabolism in miceMoruppa, Saidu M. January 1989 (has links)
No description available.
|
| 132 |
Exopolysaccharide production by xanthomonas campestrisTait, Michael Ian January 1984 (has links)
No description available.
|
| 133 |
The estimation of responses to selection in hill sheepAtkins, Kevin David January 1984 (has links)
No description available.
|
| 134 |
SCHEDULING TO OPTIMIZE FUNCTIONS OF JOB TARDINESS: PROBLEM STRUCTURE AND ALGORITHMS.VILLARREAL CAREAGA, FRANCISCO JAVIER. January 1983 (has links)
This dissertation addresses the problem of scheduling a set of jobs under two different measures of performance: total tardiness and weighted number of tardy jobs. A new solution approach is presented for the single-machine tardiness problem. This views the problem as one of determining an optimal partition of the job set into early and tardy subsets. The scheme is validated by the development of necessary conditions for optimality. It is shown that if an optimal partition of the jobs into early and tardy subsets is given, the conditions are not only necessary but also sufficient. These results are used to derive a polynomial algorithm to generate a sequence that satisfies these conditions for any arbitrary partition. The implications of these results with respect to solving the tardiness problem, as well as some other related problems, are examined. Particular emphasis is placed on the impact of the partition approach as a device to enhance the performance of existing branch-and-bound procedures. The use of this approach to generate valid inequalities is also discussed. The problem of scheduling a single machine to minimize the weighted number of tardy jobs is examined in detail. A new branch-and-bound procedure is presented as well as the first extensive computational study of the problem. The proposed algorithm relies on lower bounds obtained by means of two relaxations of the problem for which efficient solution procedures exist. The merits of both bounding schemes are extensively tested. The computational results indicate that exact solutions for large problems can be obtained in just a few seconds of computer time. The efficacy of the approach as a heuristic method is also verified. Further, the computational experience provides insight into how various problem parameters affect the solution difficulty of particular problem instances. The multiple-processor version of the weighted number of tardy jobs model is also considered. The basic algorithmic framework for the single-machine problem is extended to obtain optimal preemptive schedules for parallel machines, which may be identical, uniform, or unrelated.
|
| 135 |
Strange pariticle production at the CERN SPS ColliderOvens, J. E. V. January 1986 (has links)
No description available.
|
| 136 |
Increasing mass transfer during the electrowinning of copper from aqueous electrolytesTailoka, Francis January 1990 (has links)
No description available.
|
| 137 |
Factors affecting the rate of devitrification of fused silica powderZandian, Vahid January 1990 (has links)
No description available.
|
| 138 |
Conducting moulds and electro-fabricationHassall, P. January 1987 (has links)
No description available.
|
| 139 |
Inside the tier model : product development organization and strategies in automotive supplier firmsSoÌ?derquist, Klas Eric David January 1997 (has links)
No description available.
|
| 140 |
Developing an approach to help companies synchronise manufacturingRodrigues, Luis Henrique January 1994 (has links)
No description available.
|
Page generated in 0.0762 seconds