• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 11
  • 11
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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

Optimering och balansering av cyklisk produktion : En studie på Sandvik Materials Technology PU Borrstål

Hedlund, Tommy, Kvarnlöf, Daniel January 2016 (has links)
Aim: The purpose of this study is to present and test an algorithm that gives acceptable solutions in the optimization of a dedicated production line consisting of several machines, with regards of inventory holding cost and available capacity. The aim is also to suggest possible improvements in the practical case that has been used to test the model, which have been made in cooperation with Sandvik Materials Technology and it’s product unit Rock Drill Steel, located in Sandviken, Sweden. Method: An algorithm has been elaborated from articles and science reports and has then been tested with data from the practical case. The result has then been evaluated through an analysis where the algorithm’s ability to acceptable solutions and show potential savings with regards to capital tied up in stock of finished products, safety stock and products in work in process. Results and conclusions: The study shows that the algorithm has the ability to create acceptable solutions when given a specific demand rate, cycle time and capacity. The study also shows potential savings when using a shorter production cycle, given that the unit works in a structured way in order to shorten the production cycle. Suggestions for future research: The algorithm tested in this study needs more evaluations regarding its limits and possible benefits through practical and theoretical case studies. Contributions: The algorithm the possibility to combine principles and models aimed at solving the ELSP (Economic Lot Schedule Problem) and the principles of Schedule Leveling, which is a common term in lean production to a model that optimize inventory holding costs. These theories have similar approaches to cyclic production, but have different aims. Key words: cyclic scheduling, ELSP, economic lot size problem, schedule leveling, heijunka, lean production / Titel: Optimering och balansering av cyklisk produktion - en studie på Sandvik Materials Technology PU Borrstål Nivå: C-uppsats i ämnet Industriell Ekonomi Författare: Tommy Hedlund, Daniel Kvarnlöf Handledare: Mohammad Abid Datum: 2016 - Mars Syfte: Studiens syfte är att presentera och testa en algoritm som ger godkända resultat vid optimering av en dedikerad produktionslina bestående av flera produktionsresurser, med avseende på lagerhållningskostnad i omsättningslager samt tillgänglig kapacitet, samt att presentera möjliga förbättringsförslag utifrån de resultat som ges i det praktiska fall som simuleringsmodellen utvärderas genom. Det praktiska fallet i denna studie är Sandvik Materials Technology och dess produktenhet Borrstål. Metod: Studien har genomförts genom att en algoritm har tagits fram utifrån artiklar och forskningsrapporter på området, som sedan har prövats mot studiens praktiska fall. Resultatet har sedan utvärderats genom en analys av algoritmens förmåga att ge godkända lösningar, samt möjlig besparingspotential i det aktuella fallet utifrån kapitalbindning i omsättningslager, säkerhetslager och produkter i arbete. Resultat & slutsats: Studien visar att algoritmen har en god förmåga att skapa godkända resultat utifrån en specifik efterfrågan, cykeltid och kapacitet. Studien visar även på stora potentiella besparingar i kapitalbindning till följd av kortare cykeltid i såväl omsättningslager, säkerhetslager och produkter i arbete, givet att produktenheten arbetar strukturerat med att söka minska cykeltiden. Förslag till fortsatt forskning: Algoritmen behöver ytterligare forskning kring dess begränsningar genom att utvärderas utifrån fler praktiska och teoretiska fall. Uppsatsens bidrag: Algoritmen visar på en möjlighet att kombinera ELSP (economic lot scheduling problem) och dess modeller med de principer som återfinns inom Schedule Leveling, som är ett vanligt begrepp inom lean production. Dessa teorier liknar varandra men har till viss del skilda syften, vilka kan kombineras till en modell som optimerar produktionen med avseende på lagerhållningskostnaderna.
2

Cyclic Scheduling and Re-scheduling in Response to Change of Product Mix

Hino, Rei, Kataoka, Ryosuke January 2010 (has links)
No description available.
3

Cyclic Scheduling of Post Production Heat Treatment for Residual Stress Removal in Additive Manufactured Ti-6Al-4V

Webber, Trevor B. January 2020 (has links)
No description available.
4

Cyclic Scheduling Problems

Kampmeyer, Thomas 13 July 2006 (has links)
For classical non-cyclic scheduling problems, we are given a set of operations,each of which has to be processed exactly once. The aim is to minimize or maximizea given objective function such as makespan or sum of all (weighted) completion times for a given set of constraints. The set of constraints is usually given by precedence constraints between the operations. In contrast to these problems, for cyclic scheduling problems we are given a set of operations, each of which has to be processed infinitely often. Such types of scheduling problems arise in different application areas like compiler design, manufacturing, digital signal processing, railway scheduling, timetabling, etc. The problem is to find a periodic schedule which minimizes a given objective function. There exist two objective functions which are important in this area of cyclic scheduling. The objective which is considered throughout this work is to minimize the time difference between two succeeding occurrences of one operation for a given set of constraints. This time difference is called cycle time. In this thesis, we develop a general framework to model and to describe cyclic scheduling problems with resource constraints. Furthermore, we extend the model to describe blocking constraints for cyclic scheduling problems. In order to solve the problem, we develop a local search approach.
5

Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique / Robust optimization methods for cyclics scheduling problems

Hamaz, Idir 03 December 2018 (has links)
Plusieurs problèmes d'ordonnancement cyclique ont été étudiés dans la littérature. Cependant, la plupart de ces travaux considèrent que les paramètres sont connus avec certitude et ne prennent pas en compte les différents aléas qui peuvent survenir. Par ailleurs, un ordonnancement optimal pour un problème déterministe peut très vite devenir le pire ordonnancement en présence d'incertitude. Parmi les incertitudes que nous pouvons rencontrer dans les problèmes d'ordonnancement, la variation des durées des tâches par rapport au valeurs estimées, pannes des machines, incorporation de nouvelles tâches qui ne sont pas considérées au départ, etc. Dans cette thèse, nous étudions des problèmes d'ordonnancement cyclique où les durées des tâches sont affectées par des incertitudes. Ces dernières sont décrites par un ensemble d'incertitude où les durées des tâches sont supposées appartenir à des intervalles et le nombre de déviations par rapport aux valeurs nominales est contrôlé par un paramètre appelé budget d'incertitude. Nous étudions deux problèmes en particulier. Le premier est le problème d'ordonnancement cyclique de base (BCSP). Nous formulons celui-ci comme un problème d'optimisation robuste bi-niveau et, à partir des propriétés de cette formulation, nous proposons différents algorithmes pour le résoudre. Le deuxième problème considéré est le problème du jobshop cyclique. De manière similaire au BSCP, nous proposons une formulation en termes de problème d'optimisation bi-niveau et, en exploitant les algorithmes développés pour le problème d'ordonnancement cyclique de base, nous développons un algorithme de Branch-and-Bound pour le résoudre. Afin d'évaluer l'efficacité de notre méthode nous l'avons comparé à des méthodes de décomposition qui existent dans la littérature pour ce type de problèmes. Enfin, nous avons étudié une version du problème du jobshop cyclique où les durées des tâches prennent des valeurs dans des intervalles d'une manière uniforme et dont l'objectif est de minimiser la valeur moyenne du temps de cycle. Pour résoudre ce problème nous avons adopté un algorithme de Branch-and-Bound où chaque sous-problème de l'arbre de recherche consiste à calculer le volume d'un polytope. Enfin, pour montrer l'efficacité de chacune de ses méthodes, des résultats numériques sont présentés. / Several studies on cyclic scheduling problems have been presented in the literature. However, most of them consider that the problem parameters are deterministic and do not consider possible uncertainties on these parameters. However, the best solution for a deterministic problem can quickly become the worst one in the presence of uncertainties, involving bad schedules or infeasibilities. Many sources of uncertainty can be encountered in scheduling problems, for example, activity durations can decrease or increase, machines can break down, new activities can be incorporated, etc. In this PhD thesis, we focus on scheduling problems that are cyclic and where activity durations are affected by uncertainties. More precisely, we consider an uncertainty set where each task duration belongs to an interval, and the number of parameters that can deviate from their nominal values is bounded by a parameter called budget of uncertainty. This parameter allows us to control the degree of conservatism of the resulting schedule. In particular, we study two cyclic scheduling problems. The first one is the basic cyclic scheduling problem (BCSP). We formulate the problem as a two-stage robust optimization problem and, using the properties of this formulation, we propose three algorithms to solve it. The second considered problem is the cyclic jobshop problem (CJSP). As for the BCSP, we formulate the problem as two-stage robust optimization problem and by exploiting the algorithms proposed for the robust BCSP we propose a Branch-and-Bound algorithm to solve it. In order to evaluate the efficiency of our method, we compared it with classical decomposition methods for two-stage robust optimization problems that exist in the literature. We also studied a version of the CJSP where each task duration takes uniformly values within an interval and where the objective is to minimize the mean value of the cycle time. In order to solve the problem, we adapted the Branch-and-Bound algorithm where in each node of the search tree, the problem to be solved is the computation of a volume of a polytope. Numerical experiments assess the efficiency of the proposed methods.
6

Mathematical programming analyses of an established timberlands supply chain with interests in biofuel investments

Yeh, Kevin 12 January 2015 (has links)
In the push for clean and renewable fuels, timber derived biomass is a promising frontier for biofuel production in the United States. This thesis approaches the established timberlands biofuel implementation problem with three different mathematical programming studies, each testing feasibility and sustainability in different economic and supply related situations. In the first study, a competitive game theory approach was utilized to provide new insights into the behavior within a timberlands supply chain. We utilized Stackelberg game theory modeled with bilevel programming to represent the competing harvesting and manufacturing sectors. In the second study, the initial bilevel model was utilized in a larger two stage multiperiod model with parameter uncertainty. In this more realistic model, the first stage contained logistical decisions around biorefinery investments, such as location and capacity, while the second stage was composed of multiple discrete bilevel scenarios representing potential situations in the timberlands system. The final study focused on long term land management strategies for the timberlands supply chain. Introduction of a new biorefinery investment meant that management strategies must be altered to ensure consistent material flows to manufacturers as well as sustain the new production facility. A modified cyclic scheduling formulation was used to model a timberlands system and its planting and harvesting schedule to accommodate a new biorefinery. This cyclic model added an initial startup period to initiate biofuel production and provide time to adapt land management. The overall contribution of these studies was to analyze a biorefinery's impact on the established behavior in a timberlands supply chain. In particular, the goals of these models were to develop introductory decision making tools for timberlands supply chain managers.
7

Modelagem e programação de sistemas a eventos discretos periodicos / Modelling and programming of periodic discrete events systems

Portugal, Denise Sodero Vinhas 30 October 2006 (has links)
Orientador: Rafael Santos Mendes / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-07T23:46:24Z (GMT). No. of bitstreams: 1 Portugal_DeniseSoderoVinhas_D.pdf: 1731980 bytes, checksum: 98f3bdce8b6d0d6e00e2c6c96ba968f7 (MD5) Previous issue date: 2006 / Resumo: Uma metodologia para obter um escalonamento cíclico em Sistemas a Eventos Discretos é proposta neste trabalho. Esta metodologia parte de uma rede de Petri que modela minimamente um sistema a eventos discretos funcionando em regime periódico. O método identifica quais são as redes que podem ser tratadas por ele. As redes de Petri tratáveis serão decompostas em subredes identificadas por processos, que são classificados de acordo com suas topologias, o que permite a modelagemdo escalonamento cíclico do sistema através de uma modelagem em programação linear inteira mista. Este modelo em MILP será implementado no software GAMS. Alguns exemplos tirados da literatura serão usados para mostrar e testar a aplicação desta metodologia / Abstract: A methodology to obtain a cyclic scheduling in Discrete Events Systems is proposed in this work. This methodology initializes with a Petri netmodeling a discrete events system functioning with periodic processing. The method identifieswhich are the nets that can be treaties by him. The ¿tractable¿ Petri nets will be decomposed in subnets identified by process, which are classified according to its topologies, that permits us tomodel the cyclic scheduling of the systemby amixed integer linear programming model. This model in MILP will be implemented using software GAMS. Some examples from the literature will be used to show and to test the application of this methodology / Doutorado / Automação Industrial / Doutor em Engenharia Elétrica
8

A Smart Terrain based model for generating behavioural patterns

Sahlin, Jesper, Olsson, Victor January 2015 (has links)
I denna uppsats kommer vi att presentera en modell vars syfte är att generera beteende-mönster för rollfigurer i digitala spel. Spelgenren rollspel (eng. Role-playing games) placerarspelaren i en värld fylld av fantastiska monster och modiga hjältar. I ett sådant spel ärde goda karaktärerna minst lika viktiga som de ondskefulla varelser som spelaren kämparmot. Hur ser livet ut för en spelkaraktär när den inte hjälper spelaren på dess äventyr? Dekanske lever som fiskare på havet eller som bönder ute på fältet. Mer troligt är att de bori en by tillsammans med en massa andra spännande karaktärer. Vi undersöker hur sådanakaraktärers vardag ser ut och tittar på en teknik som används för att skapa deras beteen-demönster, Cyclic Scheduling. Tekniken innebär att utvecklare skapar scheman som styrrollfigurernas beteende. Dessa scheman måste skapas i förväg under spelets utveckling ochkräver i stora spel många arbetstimmar för att utvecklas. Modellen vi presenterar i dennauppsats använder tekniken Smart Terrain för att automatiskt generera beteendemönsteroch kan användas för att minska utvecklingstid. Vi diskuterar hur modellen kan användas iföränderliga spelvärldar där utvecklare inte i förhand vet hur spelens omgivningar kommeratt se ut. / In this thesis we present a model for the generation of behaviour patterns for charactersin digital games. In the genre Role-playing games the player is placed in a world filledwith fantastic monsters and brave heroes. In this kind of game the good characters areas important as the evil creatures the player must fight against. What kind of life doesa game character have when not helping the player on adventures? Maybe they live asfishermen on the sea or as farmers in the fields. More likely they live in villages amongstother exciting game characters. We examine what these characters’ daily routines looks likeand look at a technique used for creating their behaviour patterns, Cyclic Scheduling. Thetechnique is used by developers to create schedules that control the behaviour of charactersin games. These schedules have to be created during the game development process andfor bigger games this consumes a lot of time. The model we presents in this thesis uses thetechnique Smart Terrain to automatically generate behaviour patterns thereby reducingthe development time. We discuss how the model can be used in dynamic game worldswhere the developers are unaware of potential changes in the game world.
9

THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT

FENG, KELI 29 September 2005 (has links)
No description available.
10

Family Formation, Loading and Batch-Cyclic Flowshop Scheduling in Cellular Manufacturing Systems

Almasarwah, Najat E. January 2017 (has links)
No description available.

Page generated in 0.0834 seconds