Log in

Relevant bibliographies by topics / Scheduling. Production scheduling. Production scheduling / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Scheduling. Production scheduling. Production scheduling.

Dissertations / Theses on the topic 'Scheduling. Production scheduling. Production scheduling'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Scheduling. Production scheduling. Production scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Stephenson, Paul A. "New dominance orders for scheduling problems /." *McMaster only, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Huang, Chueng-Chiu S. "Stochastic scheduling." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Moghaddam, Atefeh. "Production scheduling : unavailabitlity of resources." Troyes, 2012. http://www.theses.fr/2012TROY0025.

Full text

Abstract:

Dans le marché d’aujourd’hui, l’un des facteurs de survie les plus importants pour une entreprise est la garantie de la satisfaction des clients. Parfois, une entreprise ne peut pas satisfaire les exigences de ses clients à cause de contraintes telles que la capacité limitée ou les dates de fin strictes. Elle est donc obligée d’ignorer certaines commandes et de les rejeter ou encore de sous-traiter ces commandes. Dans les deux cas, la société est soumise à des frais. Dans cette thèse, nous étudions les différents types de ligne de production dans lesquels le rejet des commandes est possible. D’abord, nous avons étudié le problème d’ordonnancement bi-objectif sur une seule machine. Nous avons proposé une méthode exacte et plusieurs méta-heuristiques et heuristique efficaces pour trouver une bonne estimation de solutions non-dominées. Ainsi, nous avons étudié les différents concepts de dominance afin de limiter notre recherche dans la région la plus prometteuse du front de Pareto. Par la suite, nous avons étudié un problème d’ordonnancement réentrant à deux machines. Dans ce cas, le rejet des tâches a lieu en fonction de leurs dates de fin strictes. Nous avons considéré deux décisions simultanées : l’acceptation des tâches et leur ordonnancement. Un modèle de programmation linéaire mixte en nombres entiers et différents algorithmes génétiques multi-objectifs, ainsi que l’intégration des concepts de dominance divers, ont été proposés. Enfin, un problème plus général d’ordonnancement flow-shop de permutation réentrant avec dates de fin strictes et le rejet autorisé a été abordé<br>In today’s competitive market, one of the most important survival factors for a company is the achievement of customers’ satisfaction. Sometimes, a company can not fulfill its customers’ requirements due to the constraints such as limited capacity or tight due dates so it is obliged to ignore some orders and reject them or find another supplier to out-source those orders. In both cases, the company is charged a fee. In this thesis we investigate different types of production line in which rejection of the jobs is possible. At the beginning, we studied a variant of the problem as bi-objective single-machine scheduling problem with rejection. We proposed an exact method and some efficient metaheuristics and a heuristic to find a good estimation of non-dominated solution set. We found that in industrial case, most of the time the decision maker preferred the non-dominated solutions placed in the middle part of Pareto front. So we investigated different dominance concepts apart from Pareto in order to limit our research into the most promising region of Pareto front. Then we studied a two-machine re-entrant scheduling problem with rejection. In this case, the rejection of jobs occurred due to their strict due dates. So we examined simultaneous job acceptance and scheduling decisions. A mixed integer linear programming model and different multi-objective genetic-based algorithms were proposed by integrating various dominance concepts. Finally, a more general problem of re-entrant permutation flow-shop scheduling problem with strict due dates and rejection was tackled

APA, Harvard, Vancouver, ISO, and other styles

4

Yang, Bibo. "Models and algorithms for operations scheduling problems with resource flexibility and schedule disruptions." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0006344.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wong, Yat-sing. "Production scheduling for virtual cellular manufacturing systems /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20720841.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Borsi, John Joseph. "Cyclic scheduling with spacing constraints." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/25475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cross, Fionnuala Mary. "A model for loading and sequencing a flexible manufacturing cell." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25656.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lin, Neng-pai. "Master production scheduling in uncertain environments /." Connect to resource, 1989. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1262714277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Woerlee, Auke Peter. "Decision support systems of production scheduling /." Rotterdam : Erasmus universiteit, 1991. http://catalogue.bnf.fr/ark:/12148/cb37438055v.

Full text

Abstract:

Proefschrift--Rotterdam--Erasmus universiteit, 1991.<br>Mention parallèle de titre ou de responsabilité : Beslissingsondersteunende systemen voor korte termijn produktieplanning. Résumé en néerlandais, 4 p. Ill. par l'auteur. Bibliogr. p. 151-165. Index.

APA, Harvard, Vancouver, ISO, and other styles

10

JARDIM, LEANDRO SCHOEMER. "UNDERSTANDING COMPETENCE IN PRODUCTION SCHEDULING ROUTINES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34032@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO<br>Nas organizações industriais contemporâneas, a competição global e o avanço das tecnologias de informação tornam os produtos e processos cada vez mais semelhantes. O desempenho operacional passa, então, a ser um dos principais mecanismos de diferenciação. Nesse cenário, a área de planejamento e programação da produção ganha um inédito papel estratégico. O presente estudo se propôs a investigar esse novo papel com um olhar centrado nas rotinas organizacionais e nas pessoas que exercem a função. Mais especificamente, a partir de uma abordagem qualitativa e interpretativa, o trabalho utilizou o método fenomenográfico para compreender como os programadores concebem a competência nas suas rotinas organizacionais. A análise das entrevistas identificou três diferentes concepções. A primeira está associada à tarefa de alocação eficiente de recursos e materiais. A segunda vê a programação como um processo de mediação entre as diferentes áreas da empresa. E a terceira atribui ao programador de produção a reponsabilidade de fazer a gestão estratégica da operação. Além disso, foram identificadas seis dimensões do fenômeno que explicam e diferenciam as concepções, são elas: Raciocínio lógico, Conhecimento técnico (do processo produtivo), Conhecimento sistêmico (de outras áreas), Estratégia de negociação, Aspecto manifesto da rotina e Envolvimento com a estratégia corporativa. Os achados sugerem, por fim, que a dimensão estratégica da programação é verificável, em diferentes graus, nas suas rotinas. Além disso, ao revelar a concepção competência como sendo a mediação entre as diferentes áreas da empresa, o estudo traz as estratégias de negociação para o centro do debate sobre a realização competente das rotinas de programação da produção.<br>In contemporary industrial organizations, global competition and the advancement of information technologies make products and processes increasingly similar. Operational performance then becomes one of the main differentiation mechanisms. In this scenario, the area of production planning and scheduling gains an unprecedented strategic role. The present study aimed to investigate this new role with a focus on the organizational routines and the people who perform them. More specifically, from a qualitative and interpretative approach, this study used phenomenography method to understand how schedulers conceive competence in their organizational routines. The analysis of the interviews identified three different conceptions. The first is associated with the task of efficient allocation of resources and materials. The second sees scheduling as a process of mediation between the different areas of the company. And the third assigns to the production planner the responsibility to do the strategic management of the enterprise operations. In addition, six dimensions of the phenomenon that explain and differentiate the conceptions are identified: Logical reasoning, Technical knowledge (of the productive process), Systemic knowledge (of other areas), Negotiation strategy, Manifested aspect of the routine and Involvement with corporate strategy. The findings suggest that the strategic dimension of scheduling is verifiable, to different degrees, in production planning routines. In addition, by revealing the concept of competence as being the mediation between the different areas of the company, the study brings negotiation strategies to the center of the debate on the competent realization of production planning routines.

APA, Harvard, Vancouver, ISO, and other styles

11

Lin, Neng-Pai. "Master production scheduling in uncertain environments." The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262714277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ying, Chen-Tsau Chris. "Backward simulation for production scheduling purposes /." The Ohio State University, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487861396025914.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Wang, Jiaxin. "Modelling and solving for production scheduling." Doctoral thesis, Universite Libre de Bruxelles, 1996. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212411.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hung, Yee-shing Regant. "Scheduling online batching systems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B34624016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Smith, Tristan. "Window-based project scheduling algorithms /." view abstract or download file of text, 2004. http://wwwlib.umi.com/cr/uoregon/fullcit?p3153800.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 2004.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 189-198). Also available for download via the World Wide Web; free to University of Oregon users.

APA, Harvard, Vancouver, ISO, and other styles

16

Wikum, Erick. "One-machine generalized precedence constrained scheduling." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Hung, Yee-shing Regant, and 洪宜成. "Scheduling online batching systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34624016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Jiang, Yun. "A study on cyclic hoist scheduling problems /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202003%20JIANG.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 135-138). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

19

Albritton, Michael. "Optimal finite capacity production scheduling with random demand." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/26457.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

王日昇 and Yat-sing Wong. "Production scheduling for virtual cellular manufacturing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31239468.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Rashidianfar, Rezvan. "System design of an evaluation aid for jobshop scheduling heuristics." Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183145803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hsu, Chih-hua. "Dynamic scheduling of manufacturing systems /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

James, Heath A. "Scheduling in metacomputing systems /." Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phj274.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Suresh, S. "Stochastic flow shop scheduling." Diss., Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/74776.

Full text

Abstract:

In this dissertation we present new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job that has finished processing at one machine may have to stay on that machine until the next machine is free. Our goal is to select a schedule that will minimize the makespan. Our results require various stochastic orderings of the processing time distributions. Some orderings minimize the expected makespan, and some stronger results stochastically minimize the makespan. The optimum sequence of these latter cases not only minimizes the expected makespan but also maximizes the probability of completing a set of jobs by time t for any t. The last result is concerned with scheduling jobs on two identical parallel machines. The jobs are subjected to some intree precedence constraints. We resolve a conjecture that appeared in Pinedo and Weiss (1985) and give conditions under which the conjecture is true and give examples to prove that the conjecture is false in general.<br>Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

25

Colova, Engin. "Chocolate Production Line Scheduling: A Case Study." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607583/index.pdf.

Full text

Abstract:

This study deals with chocolate production line scheduling. The particular production line allows producing multiple items at the same time. Another distinguishing property affecting the planning methodology is that an item can have different production capacities when produced in different product combinations which are called production patterns in this study. Planning is done on a 12 weeks rolling horizon. There are 21 products and 103 production patterns covering all the production possibilities. The subject of the study is to construct an algorithm that gives 12 weeks&rsquo<br>production values of each product and to construct the shift based scheduling of the first week of the planning horizon. The first part is Master Production Scheduling (MPS) and the objective is minimizing the shortage and overage costs. A mathematical modeling approach is used to solve the MPS problem. The second part is the scheduling part which aims to arrange the production patterns obtained from the MPS module within the shifts for the first week of the planning horizon considering the setup times. The MPS module is a large integer programming model. The challenge is finding a reasonable lower bound whenever possible. If it is not possible, finding a reasonable upper bound and seeking solutions better than that is the main approach. The scheduling part, after solving MPS, becomes a TSP and the setup times are sequence independent. In this part, the challenge is solving TSP with an appropriate objective function.

APA, Harvard, Vancouver, ISO, and other styles

26

Pundoor, Guruprasad. "Integrated production-distribution scheduling in supply chains." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2583.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2005<br>Thesis research directed by: Business and Management. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

27

Sun, Jun. "Development of an intelligent production scheduling system." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0016/MQ49690.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

刑衛國 and Weiguo Xing. "Evaluation and scheduling of private power production." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31242522.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Lane, R. "A problem-solving architecture for production scheduling." Thesis, Cranfield University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Xing, Weiguo. "Evaluation and scheduling of private power production." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23295338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Doulgeri, Z. "Production scheduling policy for flexible manufacturing systems." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38292.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Miller, Jeremy John. "Production scheduling in a foundry machine shop." Master's thesis, University of Cape Town, 1986. http://hdl.handle.net/11427/21924.

Full text

Abstract:

Bibliography: pages 89-92.<br>The scheduling of production in job shops is generally accomplished in four stages; aggregate planning, machine loading, sequencing and detailed scheduling. In industrial job shops, the number of jobs and machines makes detailed scheduling a particularly complicated and unwieldy task. When faced with this situation, a typical response of managements is to simply ignore the problem and apply some remedial action by adapting existing company operation procedures. The first objective of this dissertation is to indicate the dangers and inefficiencies which result when the problem of detailed scheduling is ignored. This is done in terms of a case study analysis in which the problems which currently exist in the machine shop at Atlantis Aluminium, a jobbing foundry, are illustrated. The second objective is to develop a systematic approach for the solution of detailed scheduling in job shops. Major steps in this approach are: i) a classification of shop scheduling problems ii) a survey of relevant scheduling literature in order to determine existing detailed scheduling techniques iii) the design of the scheduling system This approach is illustrated by applying it to the machine shop at Atlantis Aluminium.

APA, Harvard, Vancouver, ISO, and other styles

33

Srinivasan, Sudharshana. "Spatial Scheduling Algorithms for Production Planning Problems." VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3406.

Full text

Abstract:

Spatial resource allocation is an important consideration in shipbuilding and large-scale manufacturing industries. Spatial scheduling problems (SSP) involve the non-overlapping arrangement of jobs within a limited physical workspace such that some scheduling objective is optimized. Since jobs are heavy and occupy large areas, they cannot be moved once set up, requiring that the same contiguous units of space be assigned throughout the duration of their processing time. This adds an additional level of complexity to the general scheduling problem, due to which solving large instances of the problem becomes computationally intractable. The aim of this study is to gain a deeper understanding of the relationship between the spatial and temporal components of the problem. We exploit these acquired insights on problem characteristics to aid in devising solution procedures that perform well in practice. Much of the literature on SSP focuses on the objective of minimizing the makespan of the schedule. We concentrate our efforts towards the minimum sum of completion times objective and state several interesting results encountered in the pursuit of developing fast and reliable solution methods for this problem. Specifically, we develop mixed-integer programming models that identify groups of jobs (batches) that can be scheduled simultaneously. We identify scenarios where batching is useful and ones where batching jobs provides a solution with a worse objective function value. We present computational analysis on large instances and prove an approximation factor on the performance of this method, under certain conditions. We also provide greedy and list-scheduling heuristics for the problem and compare their objectives with the optimal solution. Based on the instances we tested for both batching and list-scheduling approaches, our assessment is that scheduling jobs similar in processing times within the same space yields good solutions. If processing times are sufficiently different, then grouping jobs together, although seemingly makes a more effective use of the space, does not necessarily result in a lower sum of completion times.

APA, Harvard, Vancouver, ISO, and other styles

34

Meichsner, Thomas. "Area scheduling in operations control of large component manufacturing." Thesis, Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/29529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Sun, Xiaoqing. "A modified shifting bottleneck approach to job shop scheduling with sequence dependent setups (MSBSS) /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Kai, and 王恺. "Decomposition-based scheduling in flexible flow shops under uncertainties." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45137213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Cutler, Mark Christopher. "A study of scheduling operations with preemptive jobs and global system interruptions /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/8729.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Moon, Jeongseung. "Timing control in manufacturing and supply chains." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04072004-180111/unrestricted/moon%5Fjeongseung%5F200312%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Tai, Chia-Hung C. "A stochastic project scheduling problem with resource constraints /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9842569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Yang, Jian. "A priori planning and real-time resources allocation /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p9992941.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Hatzikonstantis, Leonidas. "Heuristic strategies for scheduling of cellular manufacturing systems." Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339274.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Gibson, David Riviere. "Order batching procedures." Thesis, Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/32975.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Yavuz, Mesut. "Batch production smoothing with variable setup and processing times." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0010066.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Yongjiang. "An integrated process planning and production scheduling framework for mass customization /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202003%20CHENY.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 146-154). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

45

Waterer, Hamish. "Polyhedral approaches to scheduling shutdowns in production planning." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/23362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lee, Tien-Li. "A heuristic algorithm for agricultural machinery production scheduling." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0003/MQ45334.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Brander, Pär. "Essays on lot scheduling in production and disassembly /." Luleå, 2004. http://epubl.luth.se/1402-1757/2004/13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Martin, E. C., E. J. Pegelow, and S. Stedman. "Comparison of Irrigation Scheduling Methods in Cotton Production." College of Agriculture, University of Arizona (Tucson, AZ), 1995. http://hdl.handle.net/10150/210291.

Full text

Abstract:

Three different irrigation scheduling techniques were compared in this study; aerial infrared, hand -held infrared, and neutron moisture gage measurements. There were four treatments with three replications of each. Treatment one was scheduled using aerial infrared imaging and analyzes performed by Agrometrics, Inc. Treatment two was scheduled using a hand -held infrared gun. Irrigations for this treatment were initiated at a crop water stress index value of 0.3. Treatments three and four were scheduled using neutron probe measurements. Treatment three was irrigated at 45% depletion of the available soil water. Treatment four was irrigated at 45% depletion of the available soil water until mid-bloom, when the strategy was changed to irrigate at 35% depletion. Yield results showed no significant difference between the treatments.

APA, Harvard, Vancouver, ISO, and other styles

49

马俊 and Jun Ma. "Dynamic production scheduling in virtual cellular manufacturing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hdl.handle.net/10722/193066.

Full text

Abstract:

Manufacturing companies must constantly improve productivity to respond to dynamic changes in customer demand in order to maintain their competitiveness and marketshares. This requires manufacturers to adopt more efficient methodologies to design and control their manufacturing systems. In recent decades, virtual cellular manufacturing (VCM), as an advanced manufacturing concept, has attracted increasing attention in the research community, because traditional cellular manufacturing is inadequate when operating in a highly dynamic manufacturing environment. Virtual cellular manufacturing temporarily and dynamically groups production resources to form virtual cells according to production requirements, thus enjoying high production efficiency and flexibility simultaneously. The objective of this research is to develop cost-effective methodologies for manufacturing cell formation and production scheduling in virtual cellular manufacturing systems (VCMSs), operating in single-period/multi-period, and dynamic manufacturing environments. In this research, two mathematical models are developed to describe the characteristics of VCMSs operating under a single-period and a multi-period manufacturing environment respectively. These models aim to develop production schedules to minimize the total manufacturing cost incurred in manufacturing products for the entire planning horizon, taking into consideration many practical constraints such as workforce requirements, effective capacities of production resources, and delivery due dates of orders. In the multi-period case, worker training is also considered and factors affecting worker training are analyzed in detail. This research also develops a novel hybrid algorithm to solve complex production scheduling problems optimally for VCMSs. The hybrid algorithm is based on the techniques of discrete particle swarm optimization, ant colony system and constraint programming. Its framework is discrete particle swarm optimization which can locate good production schedules quickly. To prevent the optimization process being trapped into a local optimum, concepts of ant colony system and constraint programming are incorporated into the framework to greatly enhance the exploration and exploitation of the solution space, thus ensuring better quality production schedules. Sensitivity analyses of the key parameters of the hybrid algorithm are also conducted in detail to provide a theoretical foundation which shows that the developed hybrid algorithm is indeed an excellent optimization tool for production scheduling in VCMSs. In practice, the occurrence of unpredictable events such as breakdown of machines, change in the status of orders and absenteeism of workers will make the current production schedule infeasible. A new feasible production schedule may therefore need to be generated rapidly to ensure smooth manufacturing operations. This research develops several cost-effective production rescheduling strategies for VCMSs operating under different dynamic manufacturing environments. These strategies facilitates the determination of when-to and how-to take rescheduling actions. To further enhance the performance of such strategies in generating new production schedules, especially for large-scale manufacturing systems, a parallel approach is established to implement the developed hybrid algorithm on GPU with compute unified device architecture. The convergence characteristics of the proposed hybrid algorithm are also studied theoretically by using probability theory and Markov chain model. The analysis results show that the optimization process will eventually converge to the global optimal solution.<br>published_or_final_version<br>Industrial and Manufacturing Systems Engineering<br>Doctoral<br>Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

50

Guinery, Jane Elizabeth. "Knowledge integration in production planning, scheduling and control." Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!