Rozprawy doktorskie na temat „Minimisation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Minimisation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Savulescu, L. E. "Simultaneous energy and water minimisation". Thesis, University of Manchester, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504684.
Pełny tekst źródłaMostafavi, S. M. ostafa. "Delay minimisation in network coding". Thesis, University of Surrey, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.529446.
Pełny tekst źródłaPriest, Andrew. "Waste minimisation for bromination chemistry". Thesis, University of York, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325651.
Pełny tekst źródłaBhikha, Harshad. "Water minimisation at Skorpion zinc". Master's thesis, University of Cape Town, 2009. http://hdl.handle.net/11427/5350.
Pełny tekst źródłaIncludes bibliographical references (leaves 80-84).
This work proposes a systemic optimisation of the water balance of the Skorpion Zinc refinery, the case study selected for this work. The Skorpion process is located in Rosh Pinah in Namibia and was selected due to its location on an ecologally sensitive region where water is scarce. The project proposes that peocess optimisation cannot occure through focus on unit operations in isolation, but rather to use the interactions between the different operations to optimise the process systematically.
Chen, Zheng. "Minimisation L¹ en mécanique spatiale". Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS229/document.
Pełny tekst źródłaIn astronautics, an important issue is to control the motion of a satellite subject to the gravitation of celestial bodies in such a way that certain performance indices are minimized (or maximized). In the thesis, we are interested in minimizing the L¹-norm of control for the circular restricted three-body problem. The necessary conditions for optimality are derived by using the Pontryagin maximum principle, revealing the existence of bang-bang and singular controls. Singular extremals are analyzed, and the Fuller phenomenon shows up according to the theories developed by Marchal [1] and Zelikin et al. [2, 3]. The controllability for the controlled two-body problem (a degenerate case of the circular restricted three-body problem) with control taking values in a Euclidean ball is addressed first (cf. Chapter 2). The controllability result is readily extended to the three-body problem since the drift vector field of the three-body problem is recurrent. As a result, if the admissible controlled trajectories remain in a fixed compact set, the existence of the solutions of the L¹-minimizaion problem can be obtained by a combination of Filippov theorem (see [4, Chapter 10], e.g.) and a suitable convexification procedure (see, e.g., [5]). In finite dimensions, the L¹-minimization problem is well-known to generate solutions where the control vanishes on some time intervals. While the Pontryagin maximum principle is a powerful tool to identify candidate solutions for L1-minimization problem, it cannot guarantee that the these candidates are at least locally optimal unless sufficient optimality conditions are satisfied. Indeed, it is a prerequisite to establish (as well as to be able to verify) the necessary and sufficient optimality conditions in order to solve the L¹-minimization problem. In this thesis, the crucial idea for establishing such conditions is to construct a parameterized family of extremals such that the reference extremal can be embedded into a field of extremals. Two no-fold conditions for the canonical projection of the parameterized family of extremals are devised. For the scenario of fixed endpoints, these no-fold conditions are sufficient to guarantee that the reference extremal is locally minimizing provided that each switching point is regular (cf. Chapter 3). If the terminal point is not fixed but varies on a smooth submanifold, an extra sufficient condition involving the geometry of the target manifold is established (cf. Chapter 4). Although various numerical methods, including the ones categorized as direct [6, 7], in- direct [5, 8, 9], and hybrid [10], in the literature are able to compute optimal solutions, one cannot expect a satellite steered by the precomputed optimal control (or nominal control) to move on the precomputed optimal trajectory (or nominal trajectory) due to unavoidable perturbations and errors. In order to avoid recomputing a new optimal trajectory once a deviation from the nominal trajectory occurs, the neighboring optimal feedback control, which is probably the most important practical application of optimal control theory [11, Chapter 5], is derived by parameterizing the neighboring extremals around the nominal one (cf. Chapter 5). Since the optimal control function is bang-bang, the neighboring optimal control consists of not only the feedback on thrust direction but also that on switching times. Moreover, a geometric analysis shows that it is impossible to construct the neighboring optimal control once a conjugate point occurs either between or at switching times
Tseng, Wen-Kung. "Sound minimisation for local active control". Thesis, University of Southampton, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342925.
Pełny tekst źródłaSadfi, Chérif. "Problèmes d'ordonnancement avec minimisation des encours". Grenoble INPG, 2002. http://www.theses.fr/2002INPG0016.
Pełny tekst źródłaBabahaji, Meibodi Amir. "On-site concrete waste minimisation in Iran". Thesis, Kingston University, 2015. http://eprints.kingston.ac.uk/35583/.
Pełny tekst źródłaBrown, M. D. "Energy minimisation in variational quantum Monte Carlo". Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596975.
Pełny tekst źródłaSchmitz, Marcus Thomas. "Energy minimisation techniques for distributed embedded systems". Thesis, University of Southampton, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274048.
Pełny tekst źródłaMistry, Jatin N. "Leakage power minimisation techniques for embedded processors". Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/348805/.
Pełny tekst źródłaDavid, Julien. "Génération aléatoire d'automates et analyse d'algorithmes de minimisation". Phd thesis, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00587637.
Pełny tekst źródłaVlaspouloas, Nikolaos. "Waste minimisation through sustainable magnesium oxide cement products". Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.512049.
Pełny tekst źródłaOchoa-Montiel, Marco A. "Investigation into power minimisation algorithms for behavioural synthesis". Thesis, University of Southampton, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485540.
Pełny tekst źródłaSemling, M. "Minimisation of filling time in resin transfer moulding". Thesis, University of Warwick, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343145.
Pełny tekst źródłaRamos, Gabriel de Oliveira. "Regret minimisation and system-efficiency in route choice". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/178665.
Pełny tekst źródłaMultiagent reinforcement learning (MARL) is a challenging task, where self-interested agents concurrently learn a policy that maximise their utilities. Learning here is difficult because agents must adapt to each other, which makes their objective a moving target. As a side effect, no convergence guarantees exist for the general MARL setting. This thesis exploits a particular MARL problem, namely route choice (where selfish drivers aim at choosing routes that minimise their travel costs), to deliver convergence guarantees. We are particularly interested in guaranteeing convergence to two fundamental solution concepts: the user equilibrium (UE, when no agent benefits from unilaterally changing its route) and the system optimum (SO, when average travel time is minimum). The main goal of this thesis is to show that, in the context of route choice, MARL can be guaranteed to converge to the UE as well as to the SO upon certain conditions. Firstly, we introduce a regret-minimising Q-learning algorithm, which we prove that converges to the UE. Our algorithm works by estimating the regret associated with agents’ actions and using such information as reinforcement signal for updating the corresponding Q-values. We also establish a bound on the agents’ regret. We then extend this algorithm to deal with non-local information provided by a navigation service. Using such information, agents can improve their regrets estimates, thus performing empirically better. Finally, in order to mitigate the effects of selfishness, we also present a generalised marginal-cost tolling scheme in which drivers are charged proportional to the cost imposed on others. We then devise a toll-based Q-learning algorithm, which we prove that converges to the SO and that is fairer than existing tolling schemes.
Liu, Zhen. "Building Information Modelling (BIM) aided waste minimisation framework". Thesis, Loughborough University, 2014. https://dspace.lboro.ac.uk/2134/14971.
Pełny tekst źródłaLotze, Sven. "Ion backdrift minimisation in a GEM-based TPC readout". [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=979865158.
Pełny tekst źródłaWeibel, Thomas. "Modèles de minimisation d'énergies discrètes pour la cartographie cystoscopique". Phd thesis, Université de Lorraine, 2013. http://tel.archives-ouvertes.fr/tel-00866824.
Pełny tekst źródłaWang, Y. "Wastewater minimisation and the design of wastewater treatment systems". Thesis, University of Manchester, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488391.
Pełny tekst źródłaRey, David. "Minimisation des conflits aériens par des modulations de vitesse". Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00819879.
Pełny tekst źródłaHoughton, Claire. "Development of a methodology for batch process waste minimisation". Thesis, University of Bath, 1998. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760712.
Pełny tekst źródłaAl-Shammari, Zaid Shakir Kadhim. "Power minimisation techniques for space-based wireless sensor networks". Thesis, University of Leicester, 2017. http://hdl.handle.net/2381/40862.
Pełny tekst źródłaAl-Zobaidi, Zaid. "Coherent minimisation : aggressive optimisation for symbolic finite state transducers". Thesis, University of Birmingham, 2014. http://etheses.bham.ac.uk//id/eprint/5012/.
Pełny tekst źródłaNicolici, N. "Power minimisation techniques for testing low power VLSI circuits". Thesis, University of Southampton, 2000. https://eprints.soton.ac.uk/254107/.
Pełny tekst źródłaNessah, Rabia. "Ordonnancement de la production pour la minimisation des encours". Troyes, 2005. http://www.theses.fr/2005TROY0015.
Pełny tekst źródłaThis thesis is devoted to the identical parallel machines scheduling problems. It concerns one of the most difficult criteria of the scheduling theory, that is, the minimization of the total weighted completion time. First we consider the problem where all the weights of the jobs are identical. Then we deal with the case where the weights of the jobs are arbitrary. For these two cases we consider quite frequent constraints in enterprises, such as, setup times and job release dates. We develop exact Branch-and-Bound methods for minimizing total completion time, with different release dates and with or without setup times on parallel machines, and also total weighted completion time with different release dates on one machine. For each problem, we show dominance properties, lower and upper bounds. Numerical tests show the efficiency of our algorithms. For the minimization of the weighted completion time with different release dates on parallel machines, we establish new lower bounds. We have also introduce an approximate method which the efficiency is established by numerical experimentations
Echague, Eugénio. "Optimisation globale sans dérivées par minimisation de modèles simplifiés". Versailles-St Quentin en Yvelines, 2013. http://www.theses.fr/2013VERS0016.
Pełny tekst źródłaIn this thesis, we study two global derivative-free optimization methods: the method of moments and the surrogate methods. Concerning the method of moments, it is implemented as solver of the sub-problems in a derivative-free optimization method and tested for an engine calibration problem with succes. We also explore its dual approach, and we study the approximation of a function by a sum of squares of polynomials plus a constant. Concerning the surrogate methods, we construct a new approximation by using the Sparse Grid interpolation method, which builds an accurate model from a limited number of function evaluations. This model is then locally refined near the points with low function value. The numerical performance of this new method, called GOSgrid, is tested for classical optimisation test functions and finally for an inverse parameter identification problem, showing good results compared to some of the others existing methods, in terms of number of function evaluations
Papa, Guillaume. "Méthode d'échantillonnage appliqué à la minimisation du risque empirique". Electronic Thesis or Diss., Paris, ENST, 2018. http://www.theses.fr/2018ENST0005.
Pełny tekst źródłaIn this manuscript, we present and study applied sampling strategies, with problems related to statistical learning. The goal is to deal with the problems that usually arise in a context of large data when the number of observations and their dimensionality constrain the learning process. We therefore propose to address this problem using two sampling strategies: - Accelerate the learning process by sampling the most helpful. - Simplify the problem by discarding some observations to reduce complexity and the size of the problem. We first consider the context of the binary classification, when the observations used to form a classifier come from a sampling / survey scheme and present a complex dependency structure. for which we establish bounds of generalization. Then we study the implementation problem of stochastic gradient descent when observations are drawn non uniformly. We conclude this thesis by studying the problem of graph reconstruction for which we establish new theoretical results
Boiger, Wolfgang Josef. "Stabilised finite element approximation for degenerate convex minimisation problems". Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16790.
Pełny tekst źródłaInfimising sequences of nonconvex variational problems often do not converge strongly in Sobolev spaces due to fine oscillations. These oscillations are physically meaningful; finite element approximations, however, fail to resolve them in general. Relaxation methods replace the nonconvex energy with its (semi)convex hull. This leads to a macroscopic model which is degenerate in the sense that it is not strictly convex and possibly admits multiple minimisers. The lack of control on the primal variable leads to difficulties in the a priori and a posteriori finite element error analysis, such as the reliability-efficiency gap and no strong convergence. To overcome these difficulties, stabilisation techniques add a discrete positive definite term to the relaxed energy. Bartels et al. (IFB, 2004) apply stabilisation to two-dimensional problems and thereby prove strong convergence of gradients. This result is restricted to smooth solutions and quasi-uniform meshes, which prohibit adaptive mesh refinements. This thesis concerns a modified stabilisation term and proves convergence of the stress and, for smooth solutions, strong convergence of gradients, even on unstructured meshes. Furthermore, the thesis derives the so-called flux error estimator and proves its reliability and efficiency. For interface problems with piecewise smooth solutions, a refined version of this error estimator is developed, which provides control of the error of the primal variable and its gradient and thus yields strong convergence of gradients. The refined error estimator converges faster than the flux error estimator and therefore narrows the reliability-efficiency gap. Numerical experiments with five benchmark examples from computational microstructure and topology optimisation complement and confirm the theoretical results.
Peters, Michael D. "Improving the environmental performance of small and medium sized enterprises : an assessment of attitudes and voluntary action in the UK". Thesis, University of East Anglia, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365135.
Pełny tekst źródłaZvolinschi, Anita. "On exergy analysis and entropy production minimisation in industrial ecology". Doctoral thesis, Norwegian University of Science and Technology, Department of Chemistry, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1591.
Pełny tekst źródłaThe objective of this thesis is to improve the basis for applying industrial ecology to the evaluation of material and energy resource use and transformation in industrial systems. The underlying hypothesis was that when the second law of thermodynamics is applied it improves the basis for using industrial ecology for the evaluation of the use and transformation of resources in industrial systems. Exergy analysis and entropy production calculation and minimisation of industrial processes are used as methods for analysis.
Ooi, Hoe Seng. "Position sensorless switched reluctance motor drive with torque ripple minimisation". Thesis, Imperial College London, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.398085.
Pełny tekst źródłaMcPherson, Gladys. "The role of minimisation in treatment allocation for clinical trials". Thesis, University of Aberdeen, 2011. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=167718.
Pełny tekst źródłaAlatorre-Frenk, Claudio. "Cost minimisation in micro-hydro systems using pumps-as-turbines". Thesis, University of Warwick, 1994. http://wrap.warwick.ac.uk/36099/.
Pełny tekst źródłaOfori-Darko, Francis Kwame. "Crack frequency and the minimisation of reinforcement corrosion in concrete". Thesis, London South Bank University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310062.
Pełny tekst źródłaArda, Dawn Rungnada. "The sharkskin extrusion instability and its minimisation in polyethylene processing". Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620084.
Pełny tekst źródłaMillard, D. M. "Environmental learning and SMEs : the role of waste minimisation projects". Thesis, Manchester Metropolitan University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.434367.
Pełny tekst źródłaCutforth, Claire Louise. "Understanding waste minimisation practices at the individual and household level". Thesis, Cardiff University, 2014. http://orca.cf.ac.uk/69484/.
Pełny tekst źródłaBenaim, Abderrahim. "Unicité pour un problème de minimisation à valeurs dans Sn". Metz, 1996. http://www.theses.fr/1996METZ018S.
Pełny tekst źródłaWe study the uniqueness problem for minimizers of the Landau-Lifshitz model in ferromagnetism. Under certain assumptions on the external field, we characterize all the cases where the uniqueness fails to hold. This characterization takes a very explicit and simple form when the impage of the maps lies in two-dimentional sphere. We apply the general result for some concrete problems, notably in the presence of axial symmetry. In the last part of the thesis we apply our techniques for the study of a problem with boundary data
Moisan, Thierry. "Minimisation des perturbations et parallélisation pour la planification et l'ordonnancement". Doctoral thesis, Université Laval, 2016. http://hdl.handle.net/20.500.11794/26631.
Pełny tekst źródłaWe study in this thesis two approaches that reduce the processing time needed to solve planning and ordering problems in a constraint programming context. We experiment with multiple thousands of processors on the planning and scheduling problem of wood-finish operations. These issues are of a great importance for businesses, because they can better manage their production and save costs related to their operations. The first approach consists in a parallelization of the problem solving algorithm. We propose a new parallelization technique (named PDS) of the search strategies, that reaches four goals: conservation of the nodes visit order in the search tree as defined by the sequential algorithm, balancing of the workload between the processors, robustness against hardware failures, and absence of communication between processors during the treatment. We apply this technique to parallelize the Limited Discrepancy-based (LDS) search strategy to obtain Parallel Limited Discrepancy-Based Search (PLDS). We then show that this technique can be generalized by parallelizing two other search strategies: Depth-Bounded discrepancy Search (DDS) and Depth-First Search (DFS). We obtain, respectively, Parallel Discrepancy-based Search (PDDS) and Parallel Depth-First Search (PDFS). The algorithms obtained this way create an intrinsic workload balance: the imbalance of the workload among the processors is bounded when a branch of the search tree is pruned. By using datasets coming from industrial partners, we are able to improve the best known solutions. With the second approach, we elaborated a method to minimize the changes done to an existing production plan when new information, such as additional orders, are taken into account. Completely re-planning the production activities can lead to a very different production plan which create additional costs and loss of time for businesses. We study the perturbations caused by the re-planification with three distance metrics: Hamming distance, Edit distance, and Damerau-Levenshtein Distance. We propose three mathematical models that allow to minimize these perturbations by including these metrics in the objective function when replanning. We apply this approach to the planning and scheduling problem of wood-finish operations and we demonstrate that this approach outperforms the use of the original model.
Oueslati, Laroussi. "Commande multivariable d'une serre agricole par minimisation d'un critere quadratique". Toulon, 1990. http://www.theses.fr/1990TOUL0003.
Pełny tekst źródłaBenouali, Jugurtha. "Etude et minimisation des consommations des systèmes de climatisation automobile". Paris, ENMP, 2002. http://www.theses.fr/2002ENMP1107.
Pełny tekst źródłaYu, Jiaqian. "Minimisation du risque empirique avec des fonctions de perte nonmodulaires". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLC012/document.
Pełny tekst źródłaThis thesis addresses the problem of learning with non-modular losses. In a prediction problem where multiple outputs are predicted simultaneously, viewing the outcome as a joint set prediction is essential so as to better incorporate real-world circumstances. In empirical risk minimization, we aim at minimizing an empirical sum over losses incurred on the finite sample with some loss function that penalizes on the prediction given the ground truth. In this thesis, we propose tractable and efficient methods for dealing with non-modular loss functions with correctness and scalability validated by empirical results. First, we present the hardness of incorporating supermodular loss functions into the inference term when they have different graphical structures. We then introduce an alternating direction method of multipliers (ADMM) based decomposition method for loss augmented inference, that only depends on two individual solvers for the loss function term and for the inference term as two independent subproblems. Second, we propose a novel surrogate loss function for submodular losses, the Lovász hinge, which leads to O(p log p) complexity with O(p) oracle accesses to the loss function to compute a subgradient or cutting-plane. Finally, we introduce a novel convex surrogate operator for general non-modular loss functions, which provides for the first time a tractable solution for loss functions that are neither supermodular nor submodular. This surrogate is based on a canonical submodular-supermodular decomposition
Michalska, Maria. "Algèbres de polynômes bornés sur ensembles semi-algébriques non bornés". Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00684253.
Pełny tekst źródłaVega, Martínez Esther. "Minimisation and abatement of volatile sulphur compounds in sewage sludge processing". Doctoral thesis, Universitat de Girona, 2014. http://hdl.handle.net/10803/283655.
Pełny tekst źródłaLa contaminació atmosfèrica relacionada amb la emissió de males olors s’ha convertit en els darrers anys en un motiu de preocupació social. La proximitat d’instal·lacions causants de males olors com les estacions depuradores d’aigües residuals (EDAR) a les àrees urbanes, agreuja encara més el problema. Els compostos volàtils de sofre (CVS) són un dels principals grups de compostos causants de males olors, especialment en el tractament i processament dels fangs generats a les EDARs. Actualment, existeix una gran varietat d’opcions disponibles per al tractament efectiu de les emissions dels CVS causants de males olors. La present tesi s’ha focalitzat en la minimització de emissions durant el condicionament químic dels fangs i la eliminació mitjançant tractaments a final de procés com processos d'oxidació avançada o adsorció en carbons actius
Bel, Haj Ali Wafa. "Minimisation de fonctions de perte calibrée pour la classification des images". Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00934062.
Pełny tekst źródłaHaben, Stephen A. "Conditioning and preconditioning of the minimisation problem in variational data assimilation". Thesis, University of Reading, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541945.
Pełny tekst źródłaBertout, Antoine. "Minimisation du nombre de tâches d'un système temps réel par regroupement". Thesis, Lille 1, 2015. http://www.theses.fr/2015LIL10110/document.
Pełny tekst źródłaEmbedded systems dedicated to aeronautics or automotive interact permanently with their environment. They get information from their sensors, process the data and react with their actuators. Such systems have to execute the functionalities correctly, but also to process them within the allocated time. This feature classifies those systems in the category of real-time systems. In the cited domains, those functionalities are originally defined accordingly to the dynamics of the system and their number can reach several thousand. The real-time operating systems, software which handles the processing of those functionalities on the hardware, generally limit the number of functionalities, due to the overhead caused by their management. In this work, we are interested in techniques that reduce the number of those functionalities so to overstep those restrictions. We propose clustering algorithms that ensure that timing constraints are respected. These methods are applied to monoprocessor and multiprocessor architecture with communicating processes
Sfynia, Chrysoula. "Minimisation of regulated and unregulated disinfection by-products in drinking water". Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/58879.
Pełny tekst źródłaDuerden, Christopher James. "Minimisation of energy consumption variance in manufacturing through production schedule manipulation". Thesis, University of Central Lancashire, 2016. http://clok.uclan.ac.uk/16545/.
Pełny tekst źródła