• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5878
  • 5113
  • 1559
  • 1018
  • 870
  • 683
  • 181
  • 143
  • 94
  • 85
  • 79
  • 76
  • 66
  • 62
  • 53
  • Tagged with
  • 18377
  • 4328
  • 2721
  • 1670
  • 1577
  • 1468
  • 1313
  • 1191
  • 1186
  • 1174
  • 1172
  • 1022
  • 1007
  • 956
  • 903
  • 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.
1

Planification de la production par co-décision et négociation de l'entreprise virtuelle

Ouzizi, Latifa. Vernadat, François. Khmou, Ahmed. January 2005 (has links) (PDF)
Thèse de doctorat : Automatique, spécialité Productique : Metz : 2005. / Thèse soutenue sur ensemble des travaux. Bibliogr. p. 143.
2

Hierarchical production management : the flow-control layer... /

Libosvar, Camille. January 1900 (has links)
Th. univ.--Metz--Faculté des sciences, 1988. / Bibliogr. p. 204-212.
3

Interdependenzen zwischen Produktionstheorie und der Organisation des Produktionsprozesses /

Küpper, Hans-Ulrich. January 1900 (has links)
Diss.--Wirtschaftswissenschaftliche Fakultät--Tübingen--Eberhard-Karls-Universität, 1978. / Bibliogr. p. [285]-318. Index.
4

Deterministic production and setup policies in continuous manufacturing systems. / CUHK electronic theses & dissertations collection / ProQuest dissertations and theses

January 1997 (has links)
Allowing the production rate to be changed at any time, Chapter 4 investigates the optimal production and setup scheduling policy which minimizes the average inventory, backlog, and setup costs in a one-facility, two-product system. Under the optimal control, the system will reach a limit cycle in a finite time. In the cyclic schedule, each product is produced at its demand rate for a fraction of the production time. This contradicts the conventional wisdom where only one product should be produced at its demand rate. Moreover, we partially prove the optimality of the proposed policy. / Given that the unit inventory costs are nondecreasing along the route, and the last machine is the bottleneck, Chapter 2 provides an optimal production policy, which minimizes the total inventory and backlog costs in a multiple-product flow line. The production capacity is allocated to individual products according to the ranking of marginal benefits. The capacity allocation may change only when a buffer reaches the level of zero. This approach not only extends the study from the one-product system to the multiple-product system, but also has a computational complexity of O(MN), where M and N are the number of machines and the number of products in the system. In addition, it can be applied to the discounted-cost problem. The optimality of the proposed policy is further verified by the Hamilton-Jacobi-Bellman equation. / The problem of production and setup scheduling in a one-facility, multiple-product system is considered in Chapter 3. Besides the production cycle time and the lot sizes, the production rate is also a control variable. We demonstrate that the production of the product, which has the highest unit inventory and backlog costs weighted by its demand rate, should be slowed down. Our results outperform those of the classical Economic Lot Scheduling Problem. / This research significantly improves previous results of production and setup scheduling in complex, deterministic, and multiple-product systems. Insights and conditions of better production and setup scheduling are provided. These results are not only applicable to deterministic systems, but also suitable for constructing policies for stochastic systems. / This thesis is concerned with the problem of production and setup scheduling in continuous and deterministic manufacturing systems which produce multiple products with constant exogenous demands. / Jun Yang. / "October 1997." / Source: Dissertation Abstracts International, Volume: 59-11, Section: B, page: 6019. / Supervisors: Houmin Yan; Xiaoqiang Cai. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (p. 159-168). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. Ann Arbor, MI : ProQuest dissertations and theses, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.
5

A methodology for real-time scheduling of jobs with splitting on unrelated parallel machines

Subur, Fenny 27 April 2000 (has links)
Unrelated parallel machines are machines that perform the same function but have different capacity or capability. Thus, the processing time of each job would be different on machines of different types. The scheduling environment considered is dynamic in both job release time and machine availability. Additionally, each job considered can have different weight, and due date. Split jobs are also considered in this research. The number of jobs that needs to be processed in split-modes is pre-determined and not part of the scheduling decision. Additional constraints are imposed on split jobs to ensure that the absolute difference in completion time of the split portions of a job is within a user-specified margin. These constraints are supported by the Just-In-Time manufacturing concept where inventory has to be maintained at a very low or zero level. The objective of this research is to minimize the sum of the weighted tardiness of all jobs released within the planning horizon. The research problem is modeled as a mixed (binary) integer-linear programming model and it belongs to the class of NP-hard problems. Thus, one cannot rely on using an implicit enumeration technique, such as the one based on branch-and-bound, to solve industry-size problems within a reasonable computation time. Therefore, a higher-level search heuristic, based on a concept known as tabu search, is developed to solve the problems. Four different methods based on simple and composite dispatching rules are used to generate the initial solution that is used by tabu-search as a starting point. Six different tabu-search based heuristics are developed by incorporating the different features of tabu search. The heuristics are tested on eight small problems and the quality of their solutions is compared to their optimal solutions, which are obtained by applying the branch-and-bound technique. The evaluation shows that the tabu-search based heuristics are capable of obtaining solutions of good quality within a much shorter time. The best performer among these heuristics recorded a percentage deviation of only 1.18%. The performance of the tabu-search based heuristics is compared by conducting a statistical experiment that is based on a split-plot design. Three sizes of problem structures, ranging from 9 jobs to 60 jobs and from 3 machines to 15 machines are used in the experiment. The results of the experiment reveal that in comparison to other initial-generation methods, the composite dispatching rule is capable of obtaining initial solutions that significantly accelerate the tabu search based heuristic to get to the final solution. The use of long-term memory function is proven to be advantageous in solving all problem structures. The long-term memory based on maximum-frequency strategy is recommended for solving the small problem structure, while the minimum-frequency strategy is preferred for solving medium and large problem structures. With respect to the use of tabu-list size as a parameter, the variable tabu-list size is preferred for solving the smaller problem structure, but the fixed tabu-list size is preferred as the size of the problems grows from small to medium and then large. / Graduation date: 2000
6

A computer simulation analysis of a flow shop /

Walters, Robert H. January 1984 (has links)
Thesis (M.S.)--Ohio State University, 1984. / Includes bibliographical references (leaves 129-135). Available online via OhioLINK's ETD Center
7

Contribution à la spécification d'un pilotage proactif et réactif pour la gestion des aléas

Neubert, Gilles. Campagne, Jean-Pierre. January 2006 (has links)
Thèse de doctorat : Productique : Villeurbanne, INSA : 1997. / Titre provenant de l'écran-titre. Bibliogr. p. 239-248.
8

Scheduling parallel processors

Marsh, Joseph Durward 08 1900 (has links)
No description available.
9

A loading and balancing methodology for job shop control

Irastorza, Joseph Carlos 12 1900 (has links)
No description available.
10

The design and implementation of a cell controller

Dutton, Deborah Jeanne 12 1900 (has links)
No description available.

Page generated in 0.1048 seconds