To see the other types of publications on this topic, follow the link: Advanced planning and scheduling.
Dissertations / Theses on the topic 'Advanced planning and scheduling'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Advanced planning and 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
Attri, Hitesh. "An agent based manufacturing scheduling module for Advanced Planning and Scheduling." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/31586.
Full textAbstract:
A software agents based manufacturing scheduling module for Advanced Planning and Scheduling (APS) is presented. The problem considered is scheduling of jobs with multiple operations, distinct operation processing times, arrival times, and due dates in a job shop environment. Sequence dependent setups are also considered. The additional constraints of material and resource availability are also taken into consideration. The scheduling is to be considered in integration with production planning. The production plans can be changed dynamically and the schedule is to be generated to reflect the appropriate changes. The design of a generic multi-agent framework which is domain independent along with algorithms that are used by the agents is also discussed.<br>Master of Science
2
Zhong, Runyang, and 钟润阳. "RFID-enabled real-time advanced production planning and scheduling using data mining." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50533794.
Full textAbstract:
RFID (Radio Frequency Identification) technology has been widely used in manufacturing companies to support their production decision-makings such as planning and scheduling. Significant benefits have been obtained like real-time data collection, advanced production planning and scheduling (APS), as well as efficient material tracing & tracking. However, these companies are dazed when facing vast amount of RFID data, which could be further processed to obtain some invaluable knowledge for advanced decision-makings.
This thesis proposes a holistic RFID-enabled solution for manufacturing companies which are facing typical challenges like paper-based data collection, inefficient planning and scheduling, ineffective work-in-progress (WIP) items visibility and traceability, as well as unsynchronized decision-making procedures. This solution includes several aspects. Firstly, RFID devices are systematically deployed in manufacturing sites (e.g. warehouse and shopfloors) to create an RFID-enabled ubiquitous production environment, where typical resources are converted into smart manufacturing objects (SMOs) which are able to sense and interact with each other. Thus, production logics could be carried out adaptively. Secondly, a real-time production planning and scheduling model is worked out for suiting the RFID-enabled ubiquitous manufacturing environment. This model uses several key concepts like hybrid flow shop scheduling (HFS), real-time job pool, and hierarchical decision-making principle to integrate production planning and scheduling level interactively. A real-time Kanban is proposed to coordinate these two levels. Thus, production decisions achieve a real-time fashion. Thirdly, in order to make full use of the RFID-captured real-time shopfloor production data, a data mining approach is introduced to excavate invaluable information and knowledge for APS decision-makings. Standard operation times (SOTs) and decision rules are mined for this purpose. Fourthly, an RFID-enabled real-time APS model is proposed for production decision-making. The resulting APS model is based on a hierarchical production decision-making principle to formulate planning and scheduling levels. An RFID-event driven mechanism is adopted to integrate these two levels for collaborative decision-making with the data mining approach.
An RFID-enabled real-time advanced production planning and scheduling shell (RAPShell) is developed by using the concepts and models proposed in this thesis. Some cutting-edge technologies are implemented within RAPShell such as service-oriented architecture (SOA), Software as a Service (SaaS), and XML-based (re)configuration. A case study from a real-life automotive manufacturer is presented for demonstrating how RAPShell is able to facilitate the production activities and decision-making procedures. Benefits from quantitative and qualitative aspects in this case are summarized and discussed.
Some innovative contributions are significant. Firstly, an affordable and systematic RFID deployment scheme is proposed to create an RFID-enabled ubiquitous manufacturing environment. Secondly, an entire data mining approach is worked out for discovering the invaluable information and knowledge from vast amount of RFID production data. Thirdly, an APS model using RFID-event driven and data mining technique is proposed to achieve ultimate APS within the ubiquitous manufacturing. Finally, insights and lessons learnt from this research and implementations are generated as managerial implications which could be referred by both academics and practitioners when contemplating the RFID-enabled solution.<br>published_or_final_version<br>Industrial and Manufacturing Systems Engineering<br>Doctoral<br>Doctor of Philosophy
3
Chiavacci, Giacomo. "Introduzione di un sistema Advanced Planning and Scheduling nel settore metalmeccanico: il caso Fabio Perini S.p.A." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20160/.
Full textAbstract:
Il seguente lavoro di tesi riguarda l’implementazione di un software facente parte della tipologia APS (Advanced Planning Systems o Advanced Planning & Scheduling) in un’azienda del territorio bolognese e appartenente al settore metalmeccanico. Il contesto presso cui l’attività riguardante la tesi ha avuto luogo è stato infatti quello della Fabio Perini Packaging S.p.A, azienda leader nella produzione di macchine automatiche per il packaging del tissue, conosciuta commercialmente come Casmatic e sita a Calderara di Reno; il software di cui si è studiata invece l’implementazione è denominato J-Flex e viene sviluppato dalla Tecnest Srl, azienda della provincia di Udine.
Il progetto di tesi in particolare ha riguardato uno studio di fattibilità valorizzato da una monetizzazione dei benefici riguardanti l’implementazione di tale tipologia di software presso lo stabilimento bolognese, essendo J-Flex tra l’altro già in uso nella sede principale della Fabio Perini, con sede a Lucca. L’attività portata avanti rientra in un progetto di più ampio respiro in quanto il sito di Bologna sarà utilizzato come banco di prova per poter nei prossimi mesi far adottare la suite J-Flex a tutti gli stabilimenti della Fabio Perini, nell’ottica di poter instaurare logiche di utilizzo sinergiche e condivise tra tutti i plant distribuiti per il mondo. Le motivazioni che hanno portato alla scelta dell’adozione di tale tipologia di software sono state dovute, oltre al voler utilizzare un sistema unico condiviso tra tutti gli stabilimenti al fine di aumentare la coerenza e la compatibilità dei dati e delle procedure, anche al riscontro di un basso livello di efficacia delle attività previsionali e di pianificazione.
4
Goel, Amol. "A Multi-Agent System and Auction Mechanism for Production Planning over Multiple Facilities in an Advanced Planning and Scheduling System." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/35403.
Full textAbstract:
One of the major planning problems faced by medium and large manufacturing enterprises is the distribution of production over various (production) facilities. The need for cross-facility capacity management is most evident in the high-tech industries having capital-intensive equipment and short technology life cycle. There have been solutions proposed in the literature that are based on the lagragian decomposition method which separate the overall multiple product problem into a number of single product problems. We believe that multi-agent systems, given their distributed problem solving approach can be used to solve this problem, in its entirety, more effectively. According to other researchers who have worked in this field, auction theoretic mechanisms are a good way to solve complex production planning problems. This research study develops a multi-agent system and negotiation protocol based on combinatorial auction framework to solve the given multi-facility planning problem.
The output of this research is a software library, which can be used as a multi-agent system model of the multi-product, multi-facility capacity allocation problem. The negotiation protocol for the agents is based on an iterative combinatorial auction framework which can be used for making allocation decisions in this environment in real-time. A simulator based on this library is created to validate the multi-agent model as well as the auction theoretic framework for different scenarios in the problem domain. The planning software library is created using open source standards so that it can be seamlessly integrated with scheduling library being developed as a part of the Advanced Planning and Scheduling (APS) system project or any other software suite which might require this functionality.
The research contribution of this study is in terms of a new multi-agent architecture for an Advanced Planning and Control (APS) system as well as a novel iterative combinatorial auction mechanism which can be used as an agent negotiation protocol within this architecture. The theoretical concepts introduced by this research are implemented in the MultiPlanner production planning tool which can be used for generating master production plans for manufacturing enterprises. The validation process carried out on both the iterative combinatorial framework and the agent-based production planning methodology demonstrate that the proposed solution strategies can be used for integrated decision making in the multi-product, multi-facility production planning domain. Also, the software tool developed as part of this research is a robust, platform independent tool which can be used by manufacturing enterprises to make relevant production planning decisions.<br>Master of Science
5
Stéen, Johan. "Improving Supply Chain Management with Advanced Planning and Scheduling : Effects and possibilities with an international perspective." Thesis, Linköping University, Department of Management and Economics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6185.
Full textAbstract:
<p>Companies are more and more moving to low wage regions like Eastern Europe and Asia to stay competitive. Instead of lowering the cost of production, it has been argued that a company can stay competitive through making the use of the resources more efficient. In this study the effects a German resource saving concept, involving reorganization towards processes and an Advanced Planning and Scheduling (APS) module, has on Supply Chain Management (SCM) are investigated. In addition to this a comparison between German best-practice companies and Swedish companies has been done. This comparison was conducted in order to determine the changes needed to be made when taking this German concept to Swedish companies.</p><p>The results of this study indicate that through the German resource saving concept major improvements in delivery performance, responsiveness, supply chain costs, and asset management can be achieved. Further, this study has shown that there are very good possibilities for Swedish companies at reaching these improvements successfully. Barriers to a success in Sweden include a lack of managerial commitment and hierarchies as well as outsourced IT departments at Swedish companies. Recommendations to overcome these barriers consist of training key users more thoroughly and stressing the importance of committed managers.</p>
6
Malagoli, Elena. "Riorganizzazione della gestione della produzione mediante Advanced Planning & Scheduling System (APS) e Value Stream Mapping nel settore arredo di lusso." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.
Find full textAbstract:
Questo elaborato di tesi descrive il lavoro svolto nel periodo di tirocinio per tesi presso l’azienda Eurosystem Spa, con sede a Bologna, all’interno del team APS e MES. In questo elaborato viene descritta l’attività di consulenza in ambito MES e APS per un’azienda produttrice di mobili di lusso. In particolare, sfruttando le potenzialità fornite dal software PlanetTogether APS per la schedulazione della produzione e quindi tramite esso, conseguire delle soluzioni di miglioramento, nell’ottica di un’ottimizzazione della produzione e riduzione dei tempi di consegna. Per la precisione verrà approfondita la fase di cambiamento di produzione verso una logica ATO dell’azienda cliente, partendo da una logica MTO. Ciò comporterà l’analisi del punto di disaccoppiamento della produzione e relativa analisi degli sprechi al fine di ridurre il più possibile il lead time di produzione. In ausilio a questo passaggio viene usato, anche il metodo della Value Stream Mapping per individuare più facilmente la fonte degli sprechi e realizzare uno scenario TO BE più accurato.
7
Sousa, Sandra Isabel Ferreira de. "Heuristic approaches for a flexible job-shop scheduling problem." Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/17578.
Full textAbstract:
Mestrado em Engenharia e Gestão Industrial<br>Este trabalho aborda um novo tipo de problema de escalonamento que pode ser encontrado em várias aplicações do mundo-real, principalmente na indústria transformadora. Em relação à configuração do shop floor, o problema pode ser classificado como flexible job-shop, onde os trabalhos podem ter diferentes rotas ao longo dos recursos e as suas operações têm um conjunto de recursos onde podem ser realizadas. Outras características de processamento abordadas são: datas possíveis de início, restrições de precedência (entre operações de um mesmo trabalho ou entre diferentes trabalhos), capacidade dos recursos (incluindo paragens, alterações na capacidade e capacidade infinita) e tempos de setup (que podem ser dependentes ou independentes da sequência). O objetivo é minimizar o número total de trabalhos atrasados.
Para resolver o novo problema de escalonamento proposto um modelo de programação linear inteira mista é apresentado e novas abordagens heurísticas são propostas.
Duas heurísticas construtivas, cinco heurísticas de melhoramento e duas metaheurísticas são propostas. As heurísticas construtivas são baseadas em regras de ordenação simples, onde as principais diferenças entre elas dizem respeito às regras de ordenação utilizadas e à forma de atribuir os recursos às operações. Os métodos são designados de job-by-job (JBJ), operation-by-operation (OBO) e resource-by-resource (RBR). Dentro das heurísticas de melhoramento, a reassign e a external exchange visam alterar a atribuição dos recursos, a internal exchange e a swap pretendem alterar a sequência de operações e a reinsert-reassign é focada em mudar, simultaneamente, ambas as partes. Algumas das heurísticas propostas são usadas em metaheurísticas, nomeadamente a greedy randomized adaptive search procedure (GRASP) e a iterated local search (ILS).
Para avaliar estas abordagens, é proposto um novo conjunto de instâncias adaptadas de problemas de escalonamento gerais do tipo flexible job-shop. De todos os métodos, o que apresenta os melhores resultados é o ILS-OBO obtendo melhores valores médios de gaps em tempos médios inferiores a 3 minutos.<br>This work addresses a new type of scheduling problem which can be found in several real-world applications, mostly in manufacturing. Regarding shop floor configuration, the problem can be classified as flexible job-shop, where jobs can have different routes passing through resources and their operations have a set of eligible resources in which they can be performed. The processing characteristics addressed are release dates, precedence constraints (either between operations of the same job or between different jobs), resources capacity (including downtimes, changes in capacity, and infinite capacity), and setup times, which can be sequence-dependent or sequence-independent. The objective is to minimise the total number of tardy jobs.
To tackle the newly proposed flexible job-shop scheduling problem (FJSP), a mixed integer linear programming model (MILP) is presented and new heuristic approaches are put forward.
Three constructive heuristics, five improvement heuristics, and two metaheuristics are proposed. The constructive heuristics are based on simple dispatching rules, where the main differences among them concern the used dispatching rules and the way resources are assigned. The methods are named job-by-job (JBJ), operation-by-operation (OBO) and resource-by-resource (RBR). Within improvement heuristics, reassign and external exchange aim to change the resources assignment, internal exchange and swap intend changing the operations sequence, and reinsert-reassign is focused in simultaneously changing both parts. Some of the proposed heuristics are used within metaheuristic frameworks, namely greedy randomized adaptive search procedure (GRASP) and iterative local search (ILS).
In order to evaluate these approaches, a new set of benchmark instances adapted from the general FJSP is proposed. Out of all methods, the one which shows the best average results is ILS-OBO obtaining the best average gap values in average times lower than 3 minutes.
8
Sousa, Thales Botelho de. "A implantação de sistemas APS sob a perspectiva de redes de inovação auto-organizadas." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/18/18156/tde-22072015-092003/.
Full textAbstract:
Esta dissertação tem como finalidade analisar a implantação de sistemas APS em empresas sob a perspectiva de redes de inovação auto-organizadas. Considera-se que a implantação do sistema APS representa uma inovação organizacional para a área de planejamento e controle da produção da empresa adquirente do software, pois comparado aos sistemas de planejamento e controle da produção predecessores, supre deficiências referentes às limitações de capacidade da empresa, flexibilidade na geração de estratégias de produção, disponibilização de prazos de entrega mais curtos e maior apoio aos processos de decisão. Considera-se também que o processo de implantação pode ser analisado sob a perspectiva de uma rede auto-organizada, formada pela empresa adquirente, implantadora e desenvolvedora do software, o que permite identificar os nós (empresas), ligações (relacionamentos), posições (atividades das empresas), fluxos tangíveis (recursos físicos) e fluxos intangíveis (troca de conhecimento e informações). A metodologia de pesquisa utilizada compreende um estudo bibliográfico para o embasamento teórico da temática proposta e de sete estudos de caso para a coleta de dados em campo. A análise e discussão do cruzamento entre as evidências teóricas e práticas visa identificar e sistematizar elementos para disponibilizar um modelo de referência para a implantação de sistemas APS. O desenvolvimento do modelo de referência foi orientado pela metodologia Enterprise Knowledge Development (EKD), e o mesmo foi avaliado por profissionais de empresas implantadoras e pesquisadores acadêmicos, a fim de verificar sua consistência e identificar possíveis melhorias.<br>This dissertation aims to analyze the APS systems implementation in companies under the selforganizing innovation networks perspective. It is considered that the APS systems implementation represents an organizational innovation in the area of production planning and control of the software\'s acquiring company, because compared to the predecessors production planning and control systems, supplies deficiencies relating to capacity constraints of the company, flexibility in the generation of production strategies and greater support to decisionmaking. It is also considered that the implementation process can be analyzed under the perspective of a self-organized network formed by the acquirer, implanter and developer companies of the software, which allows us to identify the nodes (companies), links (relationships), positions (activities of companies), tangible flows (physical resources) and intangible flows (exchange of knowledge and information). The research methodology used comprises a bibliographical study to the theoretical background of the proposed theme and seven case studies to data collection in the field. The analysis and discussion of the intersection between theoretical and practical evidences aims to identify and systematize elements for provide a reference model for the APS systems implementation. The development of the reference model was guided by the Enterprise Knowledge Development (EKD) methodology, and the model was assessed by implementing companies professionals and academic researchers in order to check its consistency and identify possible improvements.
9
Turatti, Rangel. "Solução de problemas complexos de programação através de regras desenvolvidas em tecnologia APS." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2010. http://hdl.handle.net/10183/35618.
Full textAbstract:
O ambiente competitivo no qual as empresas estão inseridas é caracterizado por mudanças frequentes na demanda de seus produtos e por uma necessidade em reduzir custos. Para obter sucesso frente à concorrência, se faz necessário alcançar resultados através da melhoria do processo produtivo, oferecendo respostas mais rápidas a variações na demanda e com uma utilização adequada dos recursos produtivos. Neste contexto, a utilização de softwares Advanced Planning and Scheduling com regra personalizada de programação possibilita melhoria no planejamento e programação da empresa no sentido dos objetivos citados. A partir disso, este trabalho propõe uma sistemática de desenvolvimento e implantação de regras de programação personalizadas. Após, é apresentada aplicação de um caso prático no qual foram detalhadas todas as etapas propostas na sistemática, desde o entendimento das necessidades da empresa até a avaliação dos resultados obtidos.<br>The competitive environment in which firms operate is characterized by frequent changes in product demand and a necessity to reduce costs. To succeed against the competition, it is necessary to gain competitive advantage by improving the production process, providing faster responses to changes in demand and proper use of productive resources. In this context, the use of Advanced Planning and Scheduling software with custom programming rule allows improved planning and programming company towards the objectives mentioned. This study proposes a systematic development and deployment of custom programming rules, next it is presented a case study which detail the stages proposed in the systematic, from the understanding of the business requirement until the evaluation of results.
10
Žákovská, Martina. "Optimalizace procesu plánování a rozvrhování výroby." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224696.
Full textAbstract:
This diploma thesis is focused on process of production planning and scheduling in company Meopta – optics, Ltd., in connection with the possibility of its optimization. The basis of the thesis is analysis of the current status of planning and production management, evaluation of theoretical approaches dealing with issues of production planning and solution proposal optimizing the existing processes. The diploma thesis was elaborated with the support of Head of operative planning in Meopta - Optics Ltd.
11
Baldi, Murilo Melhado. "Proposta de um modelo de programação estruturado a partir das particularidades do fluxo de produção de um sistema de manufatura celular." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/18/18156/tde-23042018-094809/.
Full textAbstract:
A proposta de um procedimento de programação da produção, estruturado a partir das particularidades do fluxo de produção de um sistema de manufatura celular, descrita neste trabalho, é resultado do processo de investigação da relação do uso de ferramentas computacionais, especialistas em programação da produção, envolvendo práticas de controle de estoque no abastecimento de um sistema de manufatura celular. Deste modo, o conteúdo deste trabalho trata das principais restrições inerentes a relação entre os diferentes parâmetros e variáveis do processo de fabricação deste tipo de sistema, os quais interferem diretamente na eficácia e eficiência de um sistema de programação da produção, além de enfatizar os resultados efetivos que podem ser alcançados com o uso de um software APS, assim como uma lógica de programação, com ênfase na minimização do Lead Time Offsetting. Neste contexto, além do resultado efetivo que este trabalho demonstra, a partir do uso de um sistema de programação da produção em um ambiente de manufatura celular, há, inerentemente, o destaque à relevância do tema de pesquisa, estudado na literatura, devido ao crescente aumento da complexidade dos sistemas produtivos e, consequentemente, da dificuldade de análises mais precisas do impacto que as variáveis de fluxo, como por exemplo, tempos de abastecimento e movimentação, tempos de setup e os respectivos roteiros de fabricação, podem causar no desempenho dos processos no chão de fábrica. Quanto ao método de pesquisa o estudo aborda o tema, quanto à aplicação de um modelo de programação da produção estruturado, com base no escopo da proposta, através de um estudo de caso de uma empresa fornecedora de componentes do setor de automotivo, envolvendo pesquisa de campo com acesso a documentos do processo de fabricação e da estrutura de materiais do mix de produtos relacionados, além do contato direto com os atores do processo de fabricação a partir de reuniões periódicas durante o processo de concepção do procedimento. A partir da construção do modelo de programação, cenários são gerados de modo a comparar a performance dos mesmos em um ambiente produtivo real, sendo realizadas alterações de variáveis no fluxo produtivo, a fim de obter resultados interessantes e satisfatórios, utilizando-se de parâmetros como tamanho de lote e makespan como indicadores de performance.<br>The proposal of a production programming procedure, built from the particularities of a cellular manufacturing system\'s production flow, described in this work, is the result of a investigation process about the relation of using computational tools, specialized in production programming, involving practices of inventory control in a supply system of a manufacturing cell. Thus, the content of this work deals with the main constraints inherent in the relationship between different parameters and variables of the manufacturing process, regarding this type of production system, that directly interferes in the efficiency of a production scheduling system, emphasizing the effective results that can be achieved through the use of an APS software and programming logic, with emphasis on minimizing Lead Time Offsett. Thereby, in addition to the effective result that this work demonstrates about the use of a production programming system, in a cellular manufacturing environment, we should also emphasize the topic reserchead, and studied, in this work due to the increasing complexity of manufacturing systems and environments as well as the difficulty of more precise analyzes regarding the impact of production flow variables, such as supply and movement times, setup times and the variability offered by manufacturing routes, which can cause underperformance of production processes in a factory. About the research method, this study approaches the subject, regarding the application of a programming model, based on the scope of the initial proposal, through a case study of a company that supplies automotive componentes, in the brazilian automobile sector. This study encompasses field research with access to documents of the manufacturing process as well as the bill of materials of related products, also, direct contact with the actors of the manufacturing process through periodic meetings during the procedure design process. Regarding the results achieved by this work, it is important to highlight the creation of different cenarios and comparisons that were made, regarding the use of different parameters and variables, such as makespan and lot sizing, so that the optimal experience could be achived, through the use of a customized programming model developed, exclusively, for this research.
12
Zhang, Yang. "Advances in LTL load plan design." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34712.
Full textAbstract:
A load plan specifies how freight is routed through a linehaul terminal network operated by a less-than-truckload (LTL) carrier. Determining the design of the load plan is critical to effective operations of such carriers. This dissertation makes contributions in modeling and algorithm design for three problems in LTL load plan design: (1) Refined execution cost estimation. Existing load plan design models use approximations that ignore important facts such as the nonlinearity of transportation costs with respect to the number of trailers, and empty travel beyond what is required for trailer balance that results from driver rules. We develop models that more accurately capture key operations of LTL carriers and produce accurate operational execution costs estimates; (2) Dynamic load planning. Load plans are traditionally revised infrequently by LTL carriers due to the difficulty of solving the associated optimization problem. Technological advances have now enabled carriers to consider daily load plan updates. We develop technologies that efficiently and effectively adjust a nominal load plan for a given day based on the actual freight to be served by the carrier. We present an integer programming based local search procedure, and a greedy randomized adaptive search heuristic; and (3) Stochastic load plan design. Load plan design models commonly represent origin-destination freight volumes using average demands, which do not describe freight volume fluctuations. We investigate load plan design models that explicitly utilize information on freight volume uncertainty and design load plans that most cost-effectively deal with varying freight volumes and lead to the lowest expected cost. We present a Sample Average Approximation approach and a variant of the method for solving the stochastic integer programming formulations.
13
Tang, Zhiqiang. "Traffic Scheduling for LTE Advanced." Thesis, Linköpings universitet, Kommunikationssystem, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-64665.
Full textAbstract:
Long Term Evolution (LTE) is becoming the first choice of operators when constructingthe new network infrastructure, because of its high throughput and lowlatency. Although the LTE can offer high speed data service as a benefit of widebandapplication, the large bandwidth also results in huge control signaling cost.This thesis studies how the available radio resources should be allocated todifferent users for the particular purpose. Three proposals are presented in thisthesis. The first two aim at maximizing the overall net capacity. The factors ofchannel conditions and control signaling cost are considered in the first proposalwhereas power control is supplemented as an additional factor in the second one.The third proposal aims at achieving a tradeoff between subframe efficiency andaverage data rate. Channel conditions and control signaling cost are taken intoconsideration.Resource blocks scheduling under a control signaling cost constraint is feasiblewith the knowledge of the channel condition of users. This is obtained from channelstate information directly. The first proposal studies how this scheduling isdone. The second proposal takes power allocation scheme into account. In termsof computational complexity, the methods of internal water-filling and externalwater-filling are described in the second proposal. The simulation results illustratethat the net capacity in the first proposal can be enhanced by about 5% -60% in the second proposal. The exact percentage of increase depends on differentcontrol signaling penalty.The third proposal discusses how to implement flexible subframe length underthe Rayleigh fading channel condition in the LTE system. The objective is toachieve subframe efficiency as high as possible, while maintaining the maximumaverage data rate. The simulation results illustrate that the optimal subframelength depends on control signaling cost penalty as well as on Doppler frequency.Finally, the fairness of the first proposal is compared with the improved versionsof Round Robin, Dynamic Allocation and Proportional Fair scheduling algorithms.The simulation results show that Round Robin and Dynamic Allocationoutperform the first proposal under a certain condition.<br>LOLA (Achieving Low Latency in Wireless Communication) is funded by EU FP7 (European Community’s Seventh Framework Programme).
14
Allam, S. I. G. "Planning and scheduling : A new model for planning and scheduling construction projects." Thesis, Henley Business School, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373950.
Full text
15
Obeid, Ali. "Scheduling and Advanced Process Control in semiconductor Manufacturing." Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00847032.
Full textAbstract:
In this thesis, we discussed various possibilities of integrating scheduling decisions with information and constraints from Advanced Process Control (APC) systems in semiconductor Manufacturing. In this context, important questions were opened regarding the benefits of integrating scheduling and APC. An overview on processes, scheduling and Advanced Process Control in semiconductor manufacturing was done, where a description of semiconductor manufacturing processes is given. Two of the proposed problems that result from integrating bith systems were studied and analyzed, they are :Problem of Scheduling with Time Constraints (PTC) and Problem of Scheduling with Equipement health Factor (PEHF). PTC and PEHF have multicriteria objective functions.PTC aims at scheduling job in families on non-identical parallel machines with setup times and time constraints.Non-identical machines mean that not all miachines can (are qualified to) process all types of job families. Time constraints are inspired from APC needs, for which APC control loops must be regularly fed with information from metrology operations (inspection) within a time interval (threshold). The objective is to schedule job families on machines while minimizing the sum of completion times and the losses in machine qualifications.Moreover, PEHF was defined which is an extension of PTC where scheduling takes into account the equipement Health Factors (EHF). EHF is an indicator on the state of a machine. Scheduling is now done by considering a yield resulting from an assignment of a job to a machine and this yield is defined as a function of machine state and job state.
16
Gupta, Sourabh. "Planning and scheduling of refinery operations." Thesis, University of Manchester, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494603.
Full textAbstract:
A refinery consists of crude oil operations, unit operations and product blending Operations. In crude oil operations the refinery deals with availability of crude oil and crude oil inventory management. Whereas, product blending deals with the fluctuating market requirement of the blended products. In the whole process the demand flows towards the suppliers, whereas the product flows towards the customers. However, because of volatile raw material prices, fluctuating product demands, quality improvement acts and other changing market conditions, it is difficult to have stable profit margins. In this work, we have covered refinery planning under market uncertainty, flexible scheduling of oil inventory management and the molecular level management for refinery gasoline blending in order to improve refineries competitiveness.
17
Dave, Dhaval Jitendrabhai. "Planning and scheduling of refinery operations." Thesis, University of Manchester, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.503086.
Full text
18
Lim, Lui Cheng. "Robust scheduling in forest operations planning." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45274.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.<br>Includes bibliographical references (p. 67-68).<br>Forest operations planning is a complex decision process which considers multiple objectives on the strategic, tactical and operational horizons. Decisions such as where to harvest and in what order over different time periods are just some of the many diverse and complex decisions that are needed to be made. An important issue in real-world optimization of forest harvesting planning is how to treat uncertainty of a biological nature, namely the uncertainty due to different growth rates of trees which affects their respective yields. Another important issue is in the effective use of high capital intensive forest harvesting machinery by suitable routing and scheduling assignments. The focus of this thesis is to investigate the effects of incorporating the robust formulation and a machinery assignment problem collectively to a forest harvesting model. The amount of variability in the harvest yield can be measured by sampling from historical data and suitable protection against uncertainty can be set after incorporating the use of a suitable robust formulation. A trade off between robustness to uncertainty with the deterioration in the objective value ensues. Using models based on industrial and slightly modified data, both the robust and routing formulations have been shown to affect the solution and its underlying structure thus making them necessary considerations. A study of feasibility using Monte Carlo simulation is then undertaken to evaluate the difference in average performances of the formulations as well as to obtain a method of setting the required protections with an acceptable probability of infeasibility under a given set of scenarios.<br>by Lui Cheng, Lim.<br>S.M.
19
Athawale, Samita. "Chemotherapy Appointment Scheduling and Operations Planning." University of Akron / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=akron1428951061.
Full text
20
Zaccagni, Zachary James. "Flexible autonomous robotic task scheduling using advanced RISC machines." Thesis, Wichita State University, 2008. http://hdl.handle.net/10057/2017.
Full textAbstract:
This research presents two methods for a group of Garcia robots to collaboratively decide which task to attend to, and to move to their respective locations.
One method allows for a needed flexibility and dynamic analysis in this distributed system
of any number of robots coupled with any number of target locations, but is tied too closely
to distance measurements. The other method is the implementation of Peter Molnar’s
approach, which is free from any specificity for determining preferences, but is shown to
have some other limitations. The packet loss problem inherent of broadcast communications is addressed, as well. The robots make decisions interdependently with
the other robots after the initial setup from a host computer of common environment
variables such as a map, robot and target locations. A distributed network was established first for the robots so that information could be shared. Beacon messages were broadcasted at random intervals, while the robots handled TCP and UDP messages in separate threads. Once the needed data was acquired, each robot began their task scheduling decision-making process. If additional information was required from another robot still, a robot requested it. Our algorithm for task scheduling converged to an agreement rapidly, and resolved any possible gridlocks that occurred when two robots are exactly the same distance and with the highest preference for a single target. This method is found to be too closely tied into distance measures being used for preferences. Changes in the environment, such as new robots or targets, are handled during subsequent calls to decide for both methods. The result of this thesis shows two flexible and quick methods for task scheduling and assignment.<br>Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Computer Science<br>Includes bibliographic references (leaves 56-57)
21
Zaccagni, Zachary James Namuduri Kameswara. "Flexible autonomous robotic task scheduling using advanced RISC machines." A link to full text of this thesis in SOAR, 2008. http://hdl.handle.net/10057/2017.
Full textAbstract:
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Computer Science.<br>Copyright 2008 by Zachary James Zaccagni. All Rights Reserved. Includes bibliographical references (leaves 56-57).
22
Yu, Han. "PLANNING AND SCHEDULING FOR LARGE-SCALEDISTRIBUTED SYSTEMS." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4186.
Full textAbstract:
Many applications require computing resources well beyond those available on any single system. Simulations of atomic and subatomic systems with application to material science, computations related to study of natural sciences, and computer-aided design are examples of applications that can benefit from the resource-rich environment provided by a large collection of autonomous systems interconnected by high-speed networks. To transform such a collection of systems into a user's virtual machine, we have to develop new algorithms for coordination, planning, scheduling, resource discovery, and other functions that can be automated. Then we can develop societal services based upon these algorithms, which hide the complexity of the computing system for users. In this dissertation, we address the problem of planning and scheduling for large-scale distributed systems. We discuss a model of the system, analyze the need for planning, scheduling, and plan switching to cope with a dynamically changing environment, present algorithms for the three functions, report the simulation results to study the performance of the algorithms, and introduce an architecture for an intelligent large-scale distributed system.<br>Ph.D.<br>School of Computer Science<br>Engineering and Computer Science<br>Computer Science
23
Herrera, Alex. "Integrated Scheduling Material Requirements Planning Lean Process." Digital Commons at Loyola Marymount University and Loyola Law School, 2011. https://digitalcommons.lmu.edu/etd/387.
Full textAbstract:
The objective of this project thesis was to consider a process, perform research, and analyze and document the results. The result is a recommended improved process for my current job, I have applied the principles I learned in the Loyola Marymount University (LMU) Graduate Level System Engineering and Leadership Program. By adhering to principles I have developed a plan that models those applications and ideologies, and related them into my 16 year professional career in Aerospace production scheduling in communication satellite production scheduling.
After considering several options, I decided to take on this project with the approval of my instructor Dr. Galloway. The plan was to take a general process from work, and recommend ways to improve the process through Lean application, and demonstrate the application or functions of System Engineering fundamentals applied to improving the process. From this report, I will make recommendations on ways to improve the efficiency of the process across four different disciplines and systems, which are very dependent upon each other to perform a very important function. I plan to conduct interviews with seniors in the fields mentioned and gather written data for analysis. I will apply System Engineering guidelines to help identify problems and demonstrate ways to improve efficiency in documentation processing as well.
In the project I will dissect the Enterprise Scheduling and the Material Requirements Planning (MRP) systems and explain how important an accurate Master Schedule is to the success of ordering materials, in a Just in Time (JIT) environment. I will discuss how lead times for parts ordering and materials are derived for a satellite build. I will break the sections into three parts; the first section will cover the application of the Microsoft Project Scheduling System to the Material Requirements Planning System interface. Two summarizes the results of conversations and interviews with people who interface with systems daily, and finally Section Three presents recommendations in both written and presentation format to an audience in an effort to demonstrate a lean application of continuous process improvement to a current process involving multiple systems.
Integrated Scheduling is responsible for establishing and maintaining schedule baselines in the Integrated Master Schedule (IMS). Along with managing the network databases, schedulers provide schedule support to Program Office Management (PO) and Integrated Product Teams (IPTs). Schedulers manage tier 1 to tier 5 level schedules. Scheduling leads have the responsibility to ensure that vertical and horizontal networks are updated weekly, within the enterprise, to preview the latest forecasts and potential impacts to critical path items. This allows for better monitoring of integrated schedules activities across programs, including the integration of supplier schedules. Schedulers provide regular status of schedule health metrics to corporate on a monthly basis. Responsibilities also include approval of the schedule Contract Data Requirements List (CORL). CDRL's are deliverables items to the customer and document key milestone completions. The Integrated Schedule houses the supplier schedules and has vertical and horizontal traceability, with all necessary predecessors and successors identified in the network chain. All schedule work ties to activities and criteria in the Integrated Master Plan (IMP).
The IMS is architected with the Earned Value Management System (EVMS) and includes customer and supplier needs and issues, risk mitigation, and opportunities. The IMS baseline is approved or disapproved in the Change Control Board (CCB) and is owned by the Program Manager (PM) and System Engineering (SE). Schedule status is performed weekly and analyzed for critical and near critical paths items.
The Material Requirements Planners are (MRP) responsible for working closely with the Integrated Scheduling team and Supplier Integration Management to ensure all subcontracts are definitized and managed. A plan must be developed in the schedule to manage all need dates for the ordering of bulk buy materials and long lead procurement parts, in support of the execution of contractual commitments. Planners work closely with the MRP focal to develop and maintain the Supplier Management Plan and the supplier Statement of Work (SOW). The MRP focal monitors and manages any critical path items from a subcontractor. Performance and critical path are measured in the schedule. Performance will be compared to the baseline plan and deliverable qualities for units will be identified along with part numbers in their designated fields in the master schedule.
Lean can best be described as a set of principles, concepts, and techniques designed to eliminate waste and produce an efficient, just-in-time production system, delivering to customers exactly what they need, when they need it, in the exact quantity they need, in the correct sequence, without defects, at the least possible cost. Lean is a new way of thinking, where the enterprise and its people continuously strive to learn and improve towards an ideal "perfect" waste free state, to exceed our customers' needs, thereby securing the business' future. As employees we play an intrical part in this equation, because our hands-on approach to make the little things happen, guarantees the details are covered.
With my findings I plan to make a recommendation of my project ideas to my employer, in order to finds ways to integrate some of these results, where ever feasible or even necessary. The results and conclusion will benefit the business and help the employee's progress towards a more improved and efficiency work place, while saving the company money. Included in this report and presentation package are graphs, illustrations, tables, and schedules to visually clarify and demonstrate key points to audience.
Within each section I will illustrate the current process and methods to improve it. I will share my personal views on good business Ethics and integrity when working or negotiating with subcontractors, and discuss some of the principles I learned in my Ethics class at LMU.
24
Struijker, Boudier Ivar. "Job shop scheduling with flexible maintenance planning." Thesis, Lancaster University, 2017. http://eprints.lancs.ac.uk/87305/.
Full textAbstract:
This thesis considers the scheduling challenges encountered at a particular facility in the nuclear industry. The scheduling problem is modelled as a variant of the job shop scheduling problem. Important aspects of the considered problem include the scheduling of jobs with both soft and hard due dates, and the integration of maintenance planning with job scheduling. Two variants of the scheduling problem are considered: The first variant makes the classic job shop assumption of infinite queueing capacity at each machine, while such queueing capacity is non-existent in the second variant. Without queueing capacity, the scheduling problem is a variant of the blocking job shop problem. For the non-blocking variant of the problem, it is shown that good solutions can be obtained quickly by hybridising a novel Ant Colony Optimisation method with a novel Branch and Bound method. For the blocking variant of the problem, it is shown that a novel Branch and Bound method can rapidly find optimal solutions. This Branch and Bound method is shown to provide good performance due to, amongst other things, a novel search strategy and a novel branching strategy.
25
Sedghi, Mahdieh. "Data-driven predictive maintenance planning and scheduling." Licentiate thesis, Luleå tekniska universitet, Industriell Ekonomi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-80828.
Full textAbstract:
The railway track network is one of the major modes of transportation and among a country’s most valuable infrastructure assets. Maintenance and renewal of railway infrastructure have a vital role in safety performance, the quality of the ride, train punctuality, and the life cycle cost of assets. Due to the large proportion of maintenance costs, increasing the efficiency of maintenance through optimised planning can result in high amounts of cost-saving. Moreover, from a safety perspective, late maintenance intervention can result in defective track and rollingstock components, which in severe cases, can cause severe accidents such as derailments. An effective maintenance management system is required to ensure the availability of the infrastructure system and meet the increasing capacity demand. The recent rapid technological revolution and increasing deployment of sensors and connected devices created new possibilities to increase the maintenance strategy effectiveness in the railway network. The purpose of this thesis is to expand the knowledge and methods for planning and scheduling of railway infrastructure maintenance. The research vision is to find quantitative approaches for integrated tactical planning and operational scheduling of predictive condition-based maintenance which can be put to practical use and improve the efficiency of the railway system. First, a thorough literature review study is performed to identify improvement policies for maintenance planning and scheduling in the literature and also to analyse the current approaches in optimising the maintenance planning and scheduling problem. Second, a novel data-driven multi-level decision-making framework to improve the efficiency of maintenance planning and scheduling is developed. The proposed framework aims to support the selection of track segments for maintenance by providing a practical degradation prediction model based on available condition measurement data. The framework considers the uncertainty of future predictions using the probability of surpassing a maintenance limit instead of using the predicted value. Moreover, an extensive total maintenance cost formulation is developed to include both direct and indirect preventive and corrective costs to observe the effect of using cost optimisation and grouping algorithms at the operational scheduling level. The performance of the proposed framework is evaluated through a case study based on data from a track section of the iron ore line between Boden and Luleå. The results indicate that the proposed approach can lead to cost savings in both optimal and grouping plans. This framework may be a useful decision support tool in the automated planning and scheduling of maintenance based on track geometry measurements.
26
Srinivasan, Sudharshana. "Spatial Scheduling Algorithms for Production Planning Problems." VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3406.
Full textAbstract:
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.
27
Weng, Jialai. "On advanced channel modelling for network planning." Thesis, University of Sheffield, 2016. http://etheses.whiterose.ac.uk/22361/.
Full textAbstract:
With the increasing demand for high speed wireless network services, the next generation wireless networks are proposed to use advanced wireless communication technologies. These technologies include massive MIMO, mmWave and distributed MIMO. In order to deploy wireless networks equipped with these technologies, channel models capturing the channel features and characteristics of these wireless technologies are essential in the planning and optimisation of networks. However, conventional channel models lack the capability to support these next generation network technologies. In this PhD thesis, I investigated the channel models for the next generation wireless technologies, including massive MIMO, mmWave communications and distributed MIMO. I developed channel models for network planning and optimisation based on conventional ray launching algorithms for these wireless technologies. The models have been validated and applied to optimise network performance. The existing challenge in wireless channel modelling is the improvement of modelling accuracy without increasing modelling complexity. In order to achieve this goal, a new calibration method is developed to improve the accuracy of the predication model when measurements are available. Moreover, in order to use the channel models as an effective tool in wireless network planning and optimisation, a new wireless capacity definition from radio propagation perspective is also investigated. It provides insight to the physical limit of wireless channel capacity from a radio propagation perspective.
28
OKUMA, Shigeru, Tatsuya SUZUKI, Fumiharu FUJIWARA, and Akio INABA. "Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling." Institute of Electronics, Information and Communication Engineers, 1998. http://hdl.handle.net/2237/14986.
Full text
29
Steyn, H. J. "Advanced analytics strategy formulation." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/96091.
Full textAbstract:
Thesis (MCom)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: Despite the high potential impact of advanced analytics on the performance of businesses around
the world, its uptake and application in an integrated and strategically aligned manner has been
limited. This problem is more pronounced with specific reference to optimization. Optimization
methods lag behind other analytical methods such as data visualization and predictive models
in terms of their level of adoption in organizations.
This research suggests that part of the problem of limited application and integration lies in an
overall inability of companies to develop and implement an effective advanced analytics strategy.
The primary objective of this research is therefore to establish an approach for the development
of an advanced analytics strategy for a company. Due to the absence of well described examples
or published research on the subject it was necessary to generate insight and knowledge using
a research approach that allowed for the development, testing, and improvement of a strategy
over multiple cycles. Such a research approach presented itself in the form of action research.
An initial advanced analytics strategy was developed for one of the subsidiary companies in
a group of companies. The subsidiary company specializes in the importation, distribution,
and marketing of industrial fasteners and has branches throughout South Africa. The strategy
document was presented to the senior decision makers in the holding company for evaluation.
The feedback from the evaluation was used to formulate changes to the initial strategy aimed at
improving its alignment with the decision makers’ thinking on advanced analytics and increasing
the probability of its implementation. The suggested changes from the first research cycle
were used to define the second cycle strategy framework. The second cycle strategy framework
included a strategy development process that consisted of three main steps:
• Establishing business focus and relevance which included an assessment of the value creating
potential of the business, identifying and prioritizing of value creating opportunities,
and an assessment of key underlying decision processes,
• Developing business relevant concept applications which included determining their potential
value impact and creating a ranked pipeline of decision optimization applications.
• Selecting concept applications and moving them into production. The strategy development process was informed by a number of different models, methods and
frameworks. The most important model was a detailed valuation model of the company. The
valuation model proved to be invaluable in identifying those aspects of the business where an
improvement will result in the highest potential increase in shareholder value.
The second cycle strategy framework will be used to develop an improved version of the advanced
analytics strategy for the researched company. Moreover, the generic nature of the
framework will allow for it to be used in the development of advanced analytics strategies for
other companies.<br>AFRIKAANSE OPSOMMING: Ten spyte van die potensieel omvangryke impak van gevorderde analitiese tegnieke op die
prestasie van besighede wˆereldwyd, is die toepassing en strategiese integrasie daarvan beperk.
Hierdie probleem is nog meer sigbaar wanneer die aanwending van optimeringsmetodes oorweeg
word. Die mate waarin optimeringsmetodes deur besighede aangewend word, is heelwat laer as
ander analitiese metodes soos data visualisering en vooruitskattingsmodelle.
Hierdie navorsing plaas ’n groot gedeelte van die probleem voor die deur van besighede se onvermo
¨e om effektiewe gevorderde analitiese strategie¨e te ontwikkel en te implementeer. Die
primˆere doel van die navorsing is gevolglik om ’n benadering tot die ontwikkeling van ’n analitiese
strategie vir ’n maatskappy voor te stel. In die lig van die afwesigheid van gepubliseerde
voorbeelde of soortgelyke navorsing op hierdie onderwerp moes insig en kennis gevolglik bekom
word deur die aanwending van ’n navorsingsbenadering wat die navorser in staat gestel het om
’n voorgestelde strategie te ontwikkel, te toets en te verbeter oor verskeie navorsingsiklusse. Die
navorsingsbenadering wat gebruik is staan bekend as aksienavorsing.
Die eerste gevorderde analitiese strategie is onwikkel vir een van die filiaalmaatskappye in ’n
maatskappygroep. Die filiaalmaatskappy spesialiseer in die invoer, verspreiding, en bemarking
van industri¨ele hegstukke en het takke regoor Suid Afrika. Die strategie dokument is voorgelˆe aan
die senior besluitnemers van die houermaatskappy vir oorweging. Op grond van hul terugvoer is
veranderings aan die strategie aangebring ten einde hul benadering tot gevorderde analitiese tegnieke
te akkommodeer en om die waarskynlikheid van implementering daarvan te verhoog. Die
voorgestelde veranderings is gebruik om ’n strategiese raamwerk vir die tweede navorsingsiklus
te definieer. Hierdie raamwerk sluit ’n strategiese ontwikkelingsproses in wat bestaan uit drie
hoofstappe:
• Vestiging van besigheidsfokus en relevansie wat insluit ’n oorweging van die waardeskeppingsvermo
¨e van die maatskappy, identifisering en prioritisering van waardeskeppingsgeleenthede
en die oorweging van die onderliggende besluitnemingsprosesse,
• Ontwikkeling van besigheidsrelevante konsep oplossings wat insluit die bepaling van die
potensi¨ele waarde impak en die skepping van ’n ranglys van besluitoptimeringsoplossings,
en
• Die verskuiwing van geselekteerde oplossings na ’n produksie omgewing. Die strategiese ontwikkelingsproses maak gebruik van verskeie modelle, metodes en raamwerke.
Die belangrikste model was ’n gedetaileerde waardasiemodel van die maatskappy. Die waardasiemodel
was instrumenteel in die idenfikasie van die aspekte van die maatskappy waar ’n
verbetering die grootste bydrae kan maak tot die skepping van aandeelhouerswaarde.
Die tweede siklus strategiese raamwerk sal aangewend word om ’n verbeterde analitiese strategie
vir die nagevorsde maatskappy te ontwikkel. Die generiese aard van die raamwerk sal ’n gebruiker
daarvan in staat stel om ’n gevorderde analitiese strategie vir ander maatskappye te ontwikkel.
30
Palmer, Gareth John. "An integrated approach to manufacturing planning : optimisation in process planning and job shop scheduling." Thesis, University of Huddersfield, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241154.
Full textAbstract:
Within manufacturing, increasing interest in being placed in the possibilities of integrated process planning and scheduling. Separating these two related tasks can impose constraints, on the final schedule, which are both undesirable and unnecessary. These constraints arise from premature decisions regarding the allocation of manufacturing resources. By making use of flexible process plans, these decisions can be delayed until the most appropriate time: during scheduling. The decisions can then be made on the basis of objectives common to both tasks (such as the minimisation of manufacturing cost). This thesis outlines an approach to manufacturing planning which is based on a highly general formulation of the problem. This integrated process planning/scheduling problem can be viewed as a generalisation of process plan optimisation, a task which is also considered in detail. A novel approach to plan optimisation is proposed, which in turn forms the basis for integrated planning and scheduling. Some research into integrated planning/scheduling has been reported in the literature. However, researchers differ in the way they formulate the integrated task. This thesis therefore attempts to outline a general framework for the characterisation of integrated process planning and scheduling problems. This considers both the degree and representation of process plan flexibility, and also the level of detail at which the shop floor is modelled. This framework forms a basis for a comparison of solution approaches. Published solution approaches are mostly based on the use of dispatching rules, but attempts have been made to use optimal search. The use of dispatching rules is essentially an ad hoc approach and, although relatively easy to apply in practice, produces solutions of mediocre quality. However, new research using simulated annealing suggests that neighbourhood search may offer a valuable alternative. This observation is supported by ambitious research published on the use of genetic algorithms. Because of the extreme combinatorial complexity of the combined task, optimal search methods are unlikely to be usable in practice. Furthermore, such methods exhibit a severe lack of generality because they make highly specific assumptions about problem formulation. Neighbourhood search techniques have inherent properties which give them a much higher level of generality. Although it is not an optimal search method, simulated annealing has been shown to provide solutions of significantly higher quality than those achieved by dispatching rule techniques. Also, and unlike optimal search techniques, it appears able to handle the immense complexity of the integrated planning/scheduling task. For the above reasons, it is argued that neighbourhood search techniques, such as simulated annealing, provide the best compromise available between solution quality and practical applicability.
31
McMillan, Sincere. "The Role of Advanced Practice Nurses in Advanced Care Planning for Cancer Patients." ScholarWorks, 2019. https://scholarworks.waldenu.edu/dissertations/6456.
Full textAbstract:
In the United States, more than 75% of people will spend their last months of life in a health care facility. A key role for clinicians is to discuss care goals with the patients as part of a process called advanced care planning (ACP). As part of the oncology care team, advanced practice nurses (APNs) could help to increase the frequency of ACP discussions. The purpose of this project was to assess the knowledge and practice experiences of APNs regarding ACP at a National Cancer Institute designated cancer care hospital. Carper's patterns of knowing was the theoretical framework of this project. Data from an institutional survey of APN conducted in 2017 was analyzed for this project. The survey used a standardized, validated tool designed to assess knowledge and experiences related to advanced directives and ACP among the APN staff. Survey participants included 131 APNs. Demographics and descriptive analysis of the frequency of responses was performed. Key findings were positive regarding the importance of the APN in promoting a structured communication process to discuss the patient's wishes (92%), and that an effective ACP discussion could help patients identify a trusted individual as their health care proxy (88.6%). Additionally, the data indicated that the staff APNs had a perceived lack of knowledge regarding how to conduct ACP discussions. The implications of these findings support social change by informing advanced nursing practice of the importance of ACP for patients with cancer.
32
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
33
Cederborg, Ola. "Case studies in Advanced Planning Systems for Tactical Planning in Process Industries." Licentiate thesis, Linköpings universitet, Produktionsekonomi, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-62822.
Full textAbstract:
This thesis focuses on the use of Advanced Planning System (APSs) in the tactical planning process. In addition, there is a special focus towards process industries. The overall aim is to find out if and how APSs can support the tactical planning processes and add value to the company. A discussion on APSs as such is also presented, as the general definition of APS is unclear. The study is based on three case studies, first a longitudinal case study at a single company, second a in-depth case study at the same company and last a multiple case study at four Scandinavian companies. The case descriptions provide answers to the overall purpose of the thesis, but they also contribute to the general knowledge concerning APSs, as they describe industrial use of these systems. The study reveals several improvements that companies have achieved by implementing APSs and it conclude that APSs can support the tactical planning process. The improvements are seen either as results of process changes needed to implement the APS or the APS itself. Among the improvements, centralizing, automatizing and streamlining of the tactical planning processes are three of the most prominent. But several other improvements are also found, for example improvements concerning the customer service level and inventory levels. Although several successful implementations, it is not uncommon that implementations projects fail, which is why companies need to be careful when deciding to invest in an APS. Factors found to be linked to success concerning APS implementations are discussed, with the APS’s fit to the company’s processes and existing systems along with promotional activities, either by a project champion or the top management, are found to be important.<br>ISCAPS<br>PIC-LI
34
Lütke, Entrup Matthias. "Advanced planning in fresh food industries : integrating shelf life into production planning /." Heidelberg ; New York : Physica-Verlag, 2005. http://www.springerlink.com/content/978-3-7908-1592-4.
Full text
35
Waterer, Hamish. "Polyhedral approaches to scheduling shutdowns in production planning." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/23362.
Full text
36
Ballast, Leaf Aquilla. "Selecting planning and scheduling specifications for construction projects." Thesis, Springfield, Va. : Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA379078.
Full text
37
Kraft, Christine R. "Planning, scheduling, and timetabling in a university setting." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079304/.
Full text
38
Carvalho, Jose Dinis de Araujo. "An integrated approach to process planning and scheduling." Thesis, University of Nottingham, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336952.
Full text
39
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
40
Villarreal, Monica Cecilia. "Capacity planning and scheduling with applications in healthcare." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54855.
Full textAbstract:
In this thesis we address capacity planning problems with different demand and service characteristics, motivated by healthcare applications. In the first application, we develop, implement, and assess the impact of analytical models, accompanied by a decision-support tool, for operating room (OR) staff planning decisions with different service lines. First, we propose a methodology to forecast the staff demand by service line. We use these results in a two-phase mathematical model that defines the staffing budget for each service line, and then decides how many staff to assign to each potential shift and day pair while considering staff overtime and pooling policies and other staff planning constraints. We also propose a heuristic to solve the model's second phase. We implement these models using historical data from a community hospital and analyze the effect of different model parameters and settings. Compared with the current practice, we reduce delays and staff pooling at no additional cost. We validate these conclusions through a simulation model.
In the second application, we consider the problem of staff planning and scheduling when there is an accepted time window between each order's arrival and fulfillment, with the goal of obtaining a balanced schedule that focuses on on-time demand fulfillment but also considers staff characteristics and operational practices. Hence, solving this problem requires simultaneously scheduling the staff and the forecasted demand. We propose, implement, and analyze the results of a model for staff and demand scheduling under this setting, accompanied by a decision-support tool. We implement this model in a company that offers document processing and other back-office services to healthcare providers. We provide details on the model validation, implementation, and results, including a 25\% increase in the company's staff productivity. Finally, we provide insights on the effects of some of the model's parameters and settings, and assess the performance of a proposed heuristic to solve this problem.
In the third application, we consider a non-consumable resource planning problem. Demand consists of a set of jobs, each job has a scheduled start time and duration, and belongs to a particular demand class that requires a subset of resources. Jobs can be `accepted' or `rejected,' and the service level is measured by the (weighted) percentage of accepted jobs. The goal is to find the capacity level that minimizes the total cost of the resources, subject to global and demand-class-based service level constraints. We first analyze the complexity of this problem and several of its special cases, and then we propose a model to find the optimal inventory for each type of resource. We show the convergence of the sample average approximation method to solve a stochastic extension of the model. This problem is motivated by the inventory planning decisions for surgical instruments for ORs. We study the effects of different model parameters and settings on the cost and service levels, based on surgical data from a community hospital.
41
Teng, Ya-Yuan, and 鄧雅元. "Advanced Planning and Scheduling Systems." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/41923039431015662336.
Full textAbstract:
碩士<br>國立臺灣大學<br>工業工程學研究所<br>88<br>Presently, the planning logic of traditional MRP is the resource planning methodology found in most manufacturing enterprises. The disadvantages of this planning logic are infinite capacity, inaccurate lead-time, and the sequential planning procedure. Therefore, the result is not always to be dependable in real manufacturing environment. In order to plan supply-demand balance and use the finite resources efficiently, Enterprise Resource Planning must cooperate with Advanced Planning and Scheduling systems. The synchronous planning, optimal planning, real-time planning and decision-making support capability of Advanced Planning and Scheduling systems are used for holonic enterprise planning at different levels.
The focus of this research is to analyze Advanced Planning and scheduling systems on their data structure, algorithms and advanced functions. First, a relational database with flexible and common data structure is developed. Second, the procedure of scheduling algorithms and advanced functions are studied. Third, stress tests have been designed to evaluate the robustness and efficiency of Advanced Planning and Scheduling systems. Finally, a linear programming model as an auxiliary sub-system is developed to improve the Advanced Planning and Scheduling systems.
42
Min, Chung-Hao, and 閔仲豪. "An Algorithm for Advanced Planning and Scheduling System." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/68034848388104223383.
Full textAbstract:
碩士<br>國立交通大學<br>工業工程與管理系<br>89<br>This research develops an APS (advanced planning and scheduling) algorithm based on the AT concept proposed by Woo. The AT concept advocates that the resource time allocated to a particular job should be larger than its processing time in order that the job can ‘float’ in the capsulated time interval even when it has been planned. That is, the resource time can be reallocated easily so that more jobs can be assigned to the resources and achieve higher utilization of resources.
Based on the AT concept, Woo developed an APS algorithm, which has shown better performance than some proprietary APS software in certain production scenarios. Yet, three common properties in IC foundries, alternative routing, alternative resources, and batch resources, are not concerned in Woo’s algorithm. This research enhances Woo’s work by including these three production properties in the proposed APS algorithm.
One application of APS software is for the justification of order acceptance. In order to assist sales in quickly making order acceptance decisions, this research also develops an available-to-promise mechanism based on the planning results of APS software.
43
Hung, Ming-Tsung, and 黃明宗. "Scenario Design for Testing Advanced Planning and Scheduling Software." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/01079610019568616857.
Full textAbstract:
碩士<br>國立交通大學<br>工業工程與管理系<br>89<br>Advanced Planning and Scheduling (APS) software is a recently well recognized approach in planning the operation schedules of jobs. The planning results of an effective APS software should be as close as to the actual results performed in a factory. However, in various production scenarios, the performance of an APS software might be different. This information is very helpful for a company in the decision making of choosing an APS software, but is rarely investigated.
This research aims to develop a systematic procedure for evaluating the performance of APS software under different production scenarios. We systematically review literature and propose an appropriate characterization of production scenarios for testing the effectiveness of APS software in an IC foundry. A simulation program is used to emulate the operation of a factory and generate the actual results. An anonymous APS software is used to generate the planned results. Seven performance indices are concerned, and for each index the performance evaluation results are analyzed in various design factors of production scenarios.
44
sun, lue chen, and 呂金昇. "The Research of Match between Enterprise Resource Planning and Advanced Planning scheduling." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/57838884528421574473.
Full textAbstract:
碩士<br>世新大學<br>資訊管理學研究所(含碩專班)<br>93<br>With the change of the industrial structure in recent years, no matter develop the fastest Hi-Tech industry , either traditional industry, in producing or making the activity, to march toward the whole world to draw up plans gradually , division among specialized departments, and several important development trends , such as etc. inside enterprises system combination. ;ERP system taking MAR operation logic as the core, in case of supposing that it can be limitless to produce, its operation result, the own demand that can't accord with enterprises . Advanced Planning and Scheduling system take it over. Advanced planning and scheduling is an advanced technology that mainly focuses onbalancing the supply and demand intra and inter enterprises by considering the limited enterprise resources. For profitable with utilize limited resource of enterprise fully order and customer of satisfication, Besides ERP , enterprises can choose suitable APS system. For the matching that made ERP and APS system close, enterprises need prudent assessment APS system to match the question of ERP system.
This research regards channelling the research object into enterprises of APS as, probe into ERP system and match the application benefit of APS system in enterprises. Research Discover that what channels into APS system at present still relies mainly on large-scale enterprise, Enterprises channelled into APS system at present rely mainly on managing enterprises of the international market, Most indexes of application benefit in enterprises of APS system present the positive response, The native APS system and foreign APS system is using benefit to have some differences, Plan to lead the way to use benefit to have the difference to enterprises in supply, The guest makes and melts range level to not showing the difference on the application benefits of enterprises, The native APS system and foreign APS system match native ERP system and foreign ERP system to not showing the difference on the application benefits of enterprises, It is apparent whether to match for the same supplier's APS and ERP in enterprises and use benefit difference or not, Enterprises have improved front to manage the performance to channel into APS system wholly in improving
45
WU, JI-GENG, and 吳霽耕. "Advanced Planning and Scheduling for TFT-LCD Color Filter Fab." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/44344861388559494213.
Full textAbstract:
碩士<br>國立臺灣科技大學<br>工業管理系<br>101<br>Intense global competition and declining profit have caused most Thin Film Transistor - Liquid Crystal Display (TFT-LCD) manufacturers to increase their competitiveness by improving productivity and reducing cycle times. Color Filter (CF) is one of the key components of TFT-LCD. In this research, an Advanced Planning and Scheduling (APS) system was developed with Microsoft Visual Basic for Application (VBA) to automatically generate production schedules for color filter fabs. This system can assign orders to production lines, plan order release time, and balance the equipment loading by the implementation of five major modules: order priority module (OPM), lot release module (LRM), line selection module (LSM), workload accumulation module (WAM), and workload balance module (WBM).
Experimental results indicated that APS can significantly reduce manual scheduling time while maintaining the quality of scheduling results. Compared to manual operations, it can save more than 85% of scheduling time and the quickness is especially important when rescheduling is needed due to production uncertainties such as equipment breakdown or material shortage. Production controllers can use this APS to generate initial schedule and make adjustment based on experience.
46
Lin, Jun-Tin, and 林俊廷. "Advanced Planning and Scheduling in Job Shop with Multi-DBR." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/08250526010601031115.
Full textAbstract:
碩士<br>國立成功大學<br>工程科學系專班<br>96<br>Advanced Planning and Scheduling System (APS) is usually used to find the most feasible and suitable production scheduling under the constraints of customer orders and enterprise resources. Most APS systems, based-on the Drum Buffer Rope (DBR) of Theory of Constraint (TOC), focus on the flow-shop to produce the maximum amount of products within the whole manufacture flows. When a manufacturer can produce maximum quantity of output, the flow-shop system is efficiency. While, the job-shop has to not only fulfill the customer orders' requests but also pay attention to the requested delivered time, not too early and not too late but right at the delivery dates. A job-shop needs not only to produce the maximum amount of products but also to deliver the products at the right time.
The quote:
“Do the right thing right with right people.”,
should be interpreted for manufacturers of job-shop as:
“Do the right order right with right device on right time.”
A lot of systems have bottlenecks and limitations at some point. DBR builds production plans based on a single bottleneck and the plans produce the maximum throughput of the bottleneck. While DBR is very efficient on large scale productions, it is not good at planning for small-to-medium job-shop productions with small quantity, diversity products, timely orders and multiple combinatorial parts. This study proposes a Multi-DBR model that focus on multiple bottlenecks of a production system in order to get the best throughput for every bottleneck and therefore is very suitable for small-to-medium scale productions. With proper fitting functions, Multi-DBR has been proved performing better than DBR in production efficiency and in fitting the right delivery dates when used in a real job-shop.
47
Chang, Che-Yuan, and 張哲源. "The Development of a Pattern-oriented Advanced Planning and Scheduling System." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/32727427354152466356.
Full textAbstract:
碩士<br>東海大學<br>工業工程學系<br>91<br>With the improvement of information technology, the enterprises face whole new challenges. In order to increase competitive ability, all the enterprises are chasing higher objectives, such as zero-inventory, lower cost, and shorter lead time. In the other word, a success supply chain management will be the key to attract their customers. However, because of the infinite capacity assumption of traditional production management, we can not consider most of the constraints in the manufacturing environment. Replacing the traditional planning mode is Advanced Planning and Scheduling System (APS) which makes use of new planning technology.
APS provides optimal demand and supply planning for enterprises based on Genetic Algorithm (GA), Theory of Constraint (TOC), or Operation Research (OR). Actually, not all the enterprises have same conditions. In the other word, it is not easy to develop an APS system that fits all kind of industries. How to design a more reusable software framework will be the main task of system analysis and design.
In this research, Pattern-oriented Analysis and Design (POAD) will be applied to develop an APS system and finally we hope this system framework can be more robust and higher reusability.
48
Lin, Yih-Chen, and 林義琛. "A Study of Advanced Planning and Scheduling in Supply Chain System." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/85790126898429246706.
Full textAbstract:
碩士<br>東海大學<br>工業工程學系<br>87<br>The issues of production planning and scheduling become to be more complicated due to the increasing importance of Supply Chain Management (SCM). At the mean time, traditional MIS (e.g. MRPⅡ) cannot fulfill the requirements of effective production planning. Therefore, Advanced Planning and Scheduling (APS) system is promoted to solve the complex problems that planner encounter in SCM. APS employed advanced planning technology to achieve the balance between the supply and demand by optimization the management of procurement, production and distribution logistics intra or inter the enterprise. Although APS plays an important role in SCM, its scope, functions and theoretical background are still not well understood by the academic and industries. Therefore, the objective of this research is to study the characteristics of an APS from three perspectives: (1) theoretical background, (2) functional requirements and (3) material planning approaches.
In this thesis, we first describe the basic theoretical background of APS (definition, characteristics, role, objective, planning scope and planning technologies). Then, a reference model of functions of APS is introduced through the explanation of the role and function requirements of APS in SCM. Finally, we study the approach of material planning in an APS and consturct an example to illustrate the performance benefit of an APS compared to the traditioanl MRP approach. Results of this provide a thouough backgroud fore the perfessionals who are interestes in develop an APS system.
49
Chen, Ming-da, and 陳明達. "THE INTEGRATION OF ACTIVITY-BASED COSTING AND ADVANCED PLANNING AND SCHEDULING." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/52785404111835827970.
Full textAbstract:
碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>91<br>Production & manufacture management, as we know, has been colossal reformed with rapidly development between network and information technology. In order to answer quickly the variety for market demanded, enterprise is expected to content with vender and customer by conducting Advance Planning and Scheduling (APS) in place of the traditional production planning module such as MRP, CRP, MPS and so on. Nowadays, APS commercial systems have been providing powerful planning function, including supply chain decision, network planning, production planning, material demand planning, capacity demand planning, and shop floor scheduling. However, the cost was not considered easily for each planning and decision, which without order analysis, production cost analysis, and price function, almost still executed by ERP traditional cost analysis. The thesis is to be tried to integrate cost analysis with APS systems. It could not only bring cost factor into planning decision, but also provide enterprise as a reference for cost analysis, quotation, and accept customer order.
Besides discussing the essentiality integrate APS and cost analysis and integration method, another research motive in paper is: After using the automation equipment, it has brought about the variety for production cost structure which made the traditional cost apportion method not suitable for the high-automation industry. Because direct labor cost gradually reduced in the ratio of production costs, manufacturing expenses relatively increased for the ratio. Traditional accounting system calculated by labor hours or based on machine hours to apportion in indirect cost. Actually, manufacturing expenses were not easily shared to each cost object that enterprise calculates cost which makes distorted. So, it has more literature provide Activity-Based Costing as to improve the traditional style to share the cost. Moreover, besides controversy in theory, it’s hard for ABC implement is need a lot of data to go on the procedure. The paper is try to use Activity-Based Costing combine APS, it would bring to the detail planning data that provides enterprise quickly cost analysis.
50
Chen, Tzu-Li, and 陳子立. "Simulation-Based Advanced Planning and Scheduling for TFT-LCD Module Site." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/13889147366894476806.
Full text