- 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 11 to 20 of 264 (0.077 seconds)Spelling suggestions: "subject:"productionsection control"" "subject:"productionsection coontrol""
| 11 |
An evaluation of dynamic scheduling as a method of reducing development time /Strasburg, Louis Glen, January 1960 (has links)
Thesis (M.B.A.)--Ohio State University, 1960. / Available online via OhioLINK's ETD Center
|
| 12 |
Sequencing to resolve nonsimultaneity constraints in project networksViruthiyamparambath, Venugopal 08 1900 (has links)
No description available.
|
| 13 |
Optimal lot sizing for acyclic multi-stage production systemsVenkata Rao, V. 08 1900 (has links)
No description available.
|
| 14 |
The design and implementation of a cell controllerDutton, Deborah Jeanne 12 1900 (has links)
No description available.
|
| 15 |
Determination of optimum reject allowances in manufacturingChang, Sang Hoon 08 1900 (has links)
No description available.
|
| 16 |
The nonsimultaneity constraint in network-based project management systemsDavis, Johnny Gordon 05 1900 (has links)
No description available.
|
| 17 |
Area scheduling in operations control of large component manufacturingMeichsner, Thomas 05 1900 (has links)
No description available.
|
| 18 |
A knowledge-based framework for apparel enterprise evaluationNarayanan, Sambasivan January 1991 (has links)
No description available.
|
| 19 |
A heuristic for multi-level lot-sizing problems with bottlenecks under a rolling schedule environmentToklu, Bilal January 1993 (has links)
Lot-sizing scheduling techniques determine what amount is required to meet forecasted demand whilst minimising the sum of setup and holding costs. These techniques are not adequate to provide an optimal solution to bottleneck facility problems which do not meet demands placed on them. Thus, it is necessary to analyse how much should be produced from each product with bottleneck facilities. Therefore a lot-sizing problem with bottleneck(s) under rolling schedule environment is the subject of this thesis. This research proposes a simple heuristic for multi-level lot-sizing problems where there is a bottleneck. Previous methods to solve this problem have formulated the problem as an integer programming problem and solved the problem using a Lagrangian relaxation embedded within the branch and bound procedure. Then the proposed heuristic is extended for multiple bottleneck problems, and finally applied to the real life problem. In this research it is suggested that items to be produced can be grouped into two types and a simple but efficient heuristic can be used to determine the production quantities required. A program was developed to compute production levels and was found to require only a small fraction of the computer time required by the full integer programming approach and to produce solutions of reasonable quality. The heuristic is simple to implement. Keywords: heuristics, inventory, lot-sizing, scheduling, production, bottleneck, linear programming, integer programming.
|
| 20 |
Development of a graphical decision aid for evaluation of multi-objective schedules in a job shop environmentDeshpande, Abhijit A. January 1989 (has links)
Thesis (M.S.)--Ohio University, March, 1989. / Title from PDF t.p.
|
Page generated in 0.0817 seconds