Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Integrated problem.
Thèses sur le sujet « Integrated problem »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Integrated problem ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
Balcik, Burcu. « Multi Item Integrated Location/inventory Problem ». Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/1093640/index.pdf.
Texte intégralRésumé :
In this study, the design of a three-level distribution system is considered in which a
single supplier ships a number of items to the retailers via a set of distribution
centers (DC) and stochastic demand is observed at the retailers. The problem is to
specify the number and location of the DCs, and the assignment of the retailers to
the DCs in such a way that total facility, transportation, safety stock, and joint
ordering and average inventory costs are minimized, and customer service
requirements are satisfied. Single source constraints are imposed on the assignment
of the retailers to the DCs. The integrated location/inventory model incorporates the
inventory management decisions into the strategic location/allocation decisions by
considering the benefits of risk pooling and the savings that result in the joint
replenishment of a group of items. We develop two heuristic methods to solve the
non-linear integer-programming model in an integrated way: (1) Improvement type
heuristic, (2) Constructive type heuristic. The heuristic algorithms are tested on a number of problem instances with 81 demand points (retailers) and 4 different types
of items. Both of the heuristics are able to generate solutions in very reasonable
times. The results are compared to the results of the p-median problem and found
that the total cost and the number of DCs can be lowered using our integrated model
instead of the p-median problem. Finally, sensitivity analysis is performed with
respect to the changes in inventory, transportation, and ordering cost parameters, and
variability of the demand.
2
Solyali, Oguz. « An Integrated Inventory Control And Vehicle Routing Problem ». Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606445/index.pdf.
Texte intégralRésumé :
In this study, we consider a logistics system, in which a single supplier delivers a product to multiple retailers over a finite time horizon. Supplier decides on the amount to order in each period and services retailers facing deterministic dynamic demand via a fleet of vehicles having limited capacity. Each retailer has specific minimum and maximum levels of inventory in an order-up-to level inventory policy setting. The problem is to simultaneously determine the quantity of product to order to the supplier, retailers to be visited, the quantity of product to be delivered to retailers and routes of vehicles in each period so as to minimize system-wide costs. We present a mathematical formulation for the problem, for which we develop several Lagrangian relaxation based solution procedures providing both upper and lower bounds to the problem. We implement these solution procedures on test instances and present the results. Computational study shows that our solution procedures generate good feasible solutions in reasonable time.
3
An, Aijun. « Analysis methodologies for integrated and enhanced problem-solving ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ30259.pdf.
Texte intégral
4
Daskalakis, A. « An integrated approach to the station - keeping problem ». Thesis, University of Strathclyde, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382257.
Texte intégral
5
Sajjadi, Seyed Reza. « Integrated supply chain : multi products location routing problem integrated with inventory under stochastic demand ». Diss., Wichita State University, 2008. http://hdl.handle.net/10057/2077.
Texte intégralRésumé :
When two logistical decisions of the supply chain namely location (a strategic
decision) and routing (a tactical decision) are combined, the location- routing problem (LRP) is formed. LRP deals with simultaneously locating one or more supply facility among a set (or sets) of potential facilities and assigning customers to the selected facility (or facilities). To further improve the operation of the supply chain process, it is presented in this dissertation to integrate inventory control, as another tactical decision, with the LRP. The presented model considers the multi-product network under the fixed- interval inventory policy where stochastic demands represent the customers' requirements. Moreover, the third party logistics allows excess space for selected warehouses if needed. A two phase heuristic simulated annealing is presented as solution methodology. Test problems are designed and solved by the developed algorithm to evaluate the presented solution approach. Results show that the integrated decision leads to saving on the network cost. Furthermore, two case studies are discussed to show how the presented model can be used in practiceWichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering
Includes bibliographic references (leaves 128-135)
6
Sajjadi, Seyed Reza Cheraghi Seyed Hossein. « Integrated supply chain : multi products location routing problem integrated with inventory under stochastic demand / ». A link to full text of this dissertation in SOAR, 2008. http://hdl.handle.net/10057/2077.
Texte intégralRésumé :
Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering"December 2008". Copyright Seyed Reza Sajjadi, 2008. All rights reserved Includes bibliographic references (leaves 128-135).
7
Plunkett, Bradley. « The portfolio problem in agricultural cooperatives an integrated framework / ». Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4112.
Texte intégralRésumé :
Thesis (Ph. D.)--University of Missouri-Columbia, 2005.The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (May 15, 2007) Vita. Includes bibliographical references.
8
Oyewole, Gbeminiyi John. « A Study on Integrated Transportation and Facility Location Problem ». Thesis, University of Pretoria, 2019. http://hdl.handle.net/2263/72419.
Texte intégralRésumé :
The focus of this thesis is the development and solution of problems that simultaneously involve the planning of the location of facilities and transportation decisions from such facilities to consumers. This has been termed integrated distribution planning problems with practical application in logistics and manufacturing. In this integration, different planning horizons of short, medium and long terms are involved with the possibility of reaching sub-optimal decisions being likely when the planning horizons are considered separately.
Two categories of problems were considered under the integrated distribution models. The first is referred to as the Step-Fixed Charge Location and Transportation Problem (SFCLTP). The second is termed the Fixed Charge Solid Location and Transportation Problem (FCSLTP). In these models, the facility location problem is considered to be a strategic or long term decision. The short to medium-term decisions considered are the Step-Fixed Charge Transportation Problem (SFCTP) and the Fixed Charge Solid Transportation Problem (FCSTP). Both SFCTP and FCSTP are different extensions to the classical transportation problem, requiring a trade-off between fixed and variable costs along the transportation routes to minimize total transportation costs.
Linearization and subsequent local improvement search techniques were developed to solve the SFCLTP. The first search technique involved the development of a hands-on solution including a numerical example. In this solution technique, linearization was employed as the primal solution, following which structured perturbation logic was developed to improve on the initial solution. The second search technique proposed also utilized the linearization principle as a base solution in addition to some heuristics to construct transportation problems. The resulting transportation problems were solved to arrive at a competitive solution as regards effectiveness (solution value) compared to those obtainable from standard solvers such as CPLEX.
The FCSLTP is formulated and solved using the CPLEX commercial optimization suite. A Lagrange Relaxation Heuristic (LRH) and a Hybrid Genetic Algorithm (GA) solution of the FCSLTP are presented as alternative solutions. Comparative studies between the FCSTP and the FCSLTP formulation are also presented. The LRH is demonstrated with a numerical example and also extended to hopefully generate improved upper bounds. The CPLEX solution generated better lower bounds and upper bound when compared with the extended LRH. However, it was observed that as problem size increased, the solution time of CPLEX increased exponentially. The FCSTP was recommended as a possible starting solution for solving the FCSLTP. This is due to a lower solution time and its feasible solution generation illustrated through experimentation.
The Hybrid Genetic Algorithm (HGA) developed integrates cost relaxation, greedy heuristic and a modified stepping stone method into the GA framework to further explore the solution search space. Comparative studies were also conducted to test the performance of the HGA solution with the classical Lagrange heuristics developed and CPLEX. Results obtained suggests that the performance of HGA is competitive with that obtainable from a commercial solver such as CPLEX.Thesis (PhD)--University of Pretoria, 2019.
Industrial and Systems Engineering
PhD
Unrestricted
9
Mangotra, Divya. « Integrated Decisions for Supply Chain Design and Inventory Allocation Problem ». Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19814.
Texte intégralRésumé :
Manufacturing outsourcing in the U.S. has never been stronger than it is today. Increased outsourcing has led to significant changes in the design of the retail distribution network. While the traditional distribution network had the manufacturing plants supplying goods to the retail stores directly, the off-shore manufacturing has increased the network's demand for transportation and warehousing to deliver the goods. Thus, most companies have a complex distribution network with several import and regional distribution
centers (RDC).
In this thesis, we study an integrated facility location and inventory allocation problem for designing a distribution network with multiple national (import) distribution centers (NDC) and retailers. The key decisions are where to locate the RDCs and how much inventory to hold at the different locations such that the total network cost is minimized under a pre-defined operational rule for the distribution of goods. In particular, the inventory cost analysis is based on the continuous review batch ordering policy and the base-stock policy. Both Type-I (probability of stock-outs) and Type-II (fill-rate) service level measures are used in the analysis.
Two different models are presented in this thesis for solving the integrated facility location-inventory allocation problem. The first model, continuous approximation (CA), assumes the distribution network to be located in a continuous region and replaces the discrete store locations with a store density function. The second model is a discrete representation of the problem as a mixed integer programming problem. Both the models take a nonlinear form and solution techniques are developed using the theory of nonlinear
programming and linear reformulation of nonlinear problems.
The goal of the first part of the thesis is to model the problem using a modified CA approach and an iterative solution scheme is presented to solve it. The main contribution of this work lies in developing a refined CA modeling technique when the discrete data cannot be modeled by a continuous function. In addition, the numerical analysis suggests
that the total network cost is significantly lower in the case of the integrated model as compared with the non-integrated model. It is also shown that the regular CA approach leads to a solution which is inferior to the solution obtained by the modified CA approach. Our analysis shows that the type of service measure used affects the network design.
In the second part of the thesis, the problem is modeled as a nonlinear mixed integer program and a linear reformulation solution technique is proposed to obtain a lower bound on the original problem. Computational results are presented for small problem instances. We conclude this part of the thesis by presenting an integrated model when a base stock inventory policy is used. A drop-decomposition heuristic is proposed to solve this problem.
10
Smith, Neale R. « An integrated solution methodology for two-stage manufacturing operations ». Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/25096.
Texte intégral
11
Moon, Gyo Sik. « An Algorithm for the PLA Equivalence Problem ». Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc278922/.
Texte intégralRésumé :
The Programmable Logic Array (PLA) has been widely used in the design of VLSI circuits and systems because of its regularity, flexibility, and simplicity. The equivalence problem is typically to verify that the final description of a circuit is functionally equivalent to its initial description. Verifying the functional equivalence of two descriptions is equivalent to proving their logical equivalence. This problem of pure logic is essential to circuit design. The most widely used technique to solve the problem is based on Binary Decision Diagram or BDD, proposed by Bryant in 1986. Unfortunately, BDD requires too much time and space to represent moderately large circuits for equivalence testing. We design and implement a new algorithm called the Cover-Merge Algorithm for the equivalence problem based on a divide-and-conquer strategy using the concept of cover and a derivational method. We prove that the algorithm is sound and complete. Because of the NP-completeness of the problem, we emphasize simplifications to reduce the search space or to avoid redundant computations. Simplification techniques are incorporated into the algorithm as an essential part to speed up the the derivation process. Two different sets of heuristics are developed for two opposite goals: one for the proof of equivalence and the other for its disproof. Experiments on a large scale of data have shown that big speed-ups can be achieved by prioritizing the heuristics and by choosing the most favorable one at each iteration of the Algorithm. Results are compared with those for BDD on standard benchmark problems as well as on random PLAs to perform an unbiased way of testing algorithms. It has been shown that the Cover-Merge Algorithm outperforms BDD in nearly all problem instances in terms of time and space. The algorithm has demonstrated fairly stabilized and practical performances especially for big PLAs under a wide range of conditions, while BDD shows poor performance because of its memory greedy representation scheme without adequate simplification.
12
Hruby, Dennis. « Effectiveness of an integrated technology education curriculum presented to at-risk students at Lucas Charter School ». Online version, 2002. http://www.uwstout.edu/lib/thesis/2002/2002hrubyd.pdf.
Texte intégral
13
Brown, Thomas John. « The theory of integrated empathies ». Pretoria : [s.n.], 2005. http://upetd.up.ac.za/thesis/available/etd-08242006-120817.
Texte intégral
14
Verschelden, Lucas George. « Integrated optimization and simulation models for the locomotive refueling system configuration problem ». Thesis, Kansas State University, 2017. http://hdl.handle.net/2097/38222.
Texte intégralRésumé :
Master of ScienceDepartment of Industrial and Manufacturing Systems Engineering
Todd W. Easton
Jessica L. Heier Stamm
Locomotives in the U.S. use over 3 billion gallons of fuel each year and faster refueling can increase rail network capacity without the infrastructure cost associated with new terminals or tracks. This thesis introduces the locomotive refueling system configuration problem (LRSCP), which seeks to improve efficiency in refueling yards through new technologies or policies. This research also creates two new methods to solve LRSCP. The first method uses an integer program to solve the off-line LRSCP and develop a static refueling policy. The train refueling integer program, TRIP, maximizes the weighted number of train combinations that can be refueled without delay. TRIP is optimized and its outputs are used as inputs to a simulation developed in Simio® for testing and validation. The second method creates an integrated integer program and simulation to solve the on-line LRSCP and produces a dynamic refueling policy. This tool, built in Python, incorporates a different integer program, the strike line integer program (SLIP), into the simulation. SLIP determines the optimal refueling assignment for each incoming train. The simulation incorporates SLIP’s solution for testing and validation. This tool is truly integrated and requires approximately 300 instances of SLIP to simulate a single day. Based on experimental results, solving either TRIP or SLIP and incorporating the optimal refueling policy improves railyard operations by 10 to 30%. This impact is statistically significant and increases the capacity of a railyard. Additionally, it impacts other important parameters such as time spent in the yard and the maximum queue for the railyard. Furthermore, there is a significant decrease in wasted time and an improvement to railyard efficiency. Implementing either method should increase a railyard’s capacity and significantly increase revenue opportunities.
15
Orr, Marc Stewart. « A Logic Formulation for the QCA Cell Arrangement Problem ». PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/438.
Texte intégralRésumé :
Some people believe that IC densities are approaching the fundamental limits inherent to semiconductor technologies. One alternative to semiconductors is Quantum-dot Cellular Automata (QCA); QCA is a nanotechnology that offers the potential to build denser IC's that switch at higher frequencies and run on lower power. QCA's most basic building block, the QCA cell, is inherently binary; digital circuits are implemented by arranging these QCA cells in pre-defined configurations on a two dimensional plane. This paper proposes a logic formulation that describes arranging QCA cells on a two dimensional plane; it is presented as a set of rules that can be implemented with basic Boolean variables and operators. This Boolean formulation is general and can be applied to any given specification. In addition, an optimization constraint is defined so that the logic formulation will only validate the most efficient QCA cell arrangements. The correctness of the logic formulation has been empirically verified by testing it with a SAT solver. The effectiveness of the minimization constraint in conjunction with the logic formulation has been tested with a Pseudo-Boolean ILP solver.
16
Bagchi, Tanuj. « An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design ». Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc500878/.
Texte intégralRésumé :
In this thesis, the gate matrix layout problem in VLSI design is considered where the goal is to minimize the number of tracks required to layout a given circuit and a taxonomy of approaches to its solution is presented. An efficient hybrid heuristic is also proposed for this combinatorial optimization problem, which is based on the combination of probabilistic hill-climbing technique and greedy method. This heuristic is tested experimentally with respect to four existing algorithms. As test cases, five benchmark problems from the literature as well as randomly generated problem instances are considered. The experimental results show that the proposed hybrid algorithm, on the average, performs better than other heuristics in terms of the required computation time and/or the quality of solution. Due to the computation-intensive nature of the problem, an exact solution within reasonable time limits is impossible. So, it is difficult to judge the effectiveness of any heuristic in terms of the quality of solution (number of tracks required). A probabilistic model of the gate matrix layout problem that computes the expected number of tracks from the given input parameters, is useful to this respect. Such a probabilistic model is proposed in this thesis, and its performance is experimentally evaluated.
17
Heine, Lena. « Problem solving in a foreign language [a study in content and language integrated learning] ». Berlin New York, NY de Gruyter Mouton, 2007. http://d-nb.info/999262408/04.
Texte intégral
18
Cagney, Michael Francis. « The Problem of "Big Food" and the Response of an Integrated Catholic Ecological Ethic ». Thesis, Boston College, 2016. http://hdl.handle.net/2345/bc-ir:107212.
Texte intégralRésumé :
Thesis advisor: Stephen J. PopeThis dissertation argues that industrial food production, characterized under the term “big food,” is an environmental and social problem that requires a response from Christian theology and ethics. However, previous scholarship addressing “big food” did not confront the intransigent nature of this problem. As a result of this state of the problem, the dissertation poses the question: what is an adequate response to the intransigent problem of “big food?” In response this dissertation argues that a proper response involves an integrated Catholic ecological ethic. An integrated ecological ethic combines the methods of virtue ethics and social ethics to propose virtues within a contextually aware framework. The resources of the Catholic tradition can be utilized to develop an integrated ethic that balances the concerns of ecojustice and environmental justice. The solution proposed involves the development of ecological reformulations of the virtues of charity, prudence, justice, temperance, and fortitude. The above virtues are not proposed within a theoretical vacuum, but rather within an awareness of various unjust structures in the United States that support “big food” and habituate the ecological vices of pride, fearlessness, and gluttony. The dissertation makes constructive proposals for structural change to develop structures of “big food” that can promote ecological virtue as opposed to ecological vice. In addition, the dissertation makes several recommendations for personal reforms in relation to food habits so as to move toward ecological virtues
Thesis (PhD) — Boston College, 2016
Submitted to: Boston College. Graduate School of Arts and Sciences
Discipline: Theology
19
Punch, William F. « A diagnosis system using a task integrated problem solver architecture (TIPS), including causal reasoning / ». The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487599963589822.
Texte intégral
20
Ker, Rault Philippe Ange. « Public participation in integrated water management : a wicked process for a complex societal problem ». Thesis, Cranfield University, 2008. http://dspace.lib.cranfield.ac.uk/handle/1826/4083.
Texte intégralRésumé :
The meaning of both Integrated Water Management and Public Participation (PP) are subject to interpretation by stakeholders, because the concepts of uncertainty, risk management and construction of a societal project challenge scientific expertise, political power and democratic decisions concerning public good management. I do not study PP and IWM with a normative aspiration to identify the ‘true’ problem and participation, but to investigate constructions of reality of water management challenges (WMCs) and of participation from different perspectives: which type of participation is perceived as appropriate for which type of water management challenges? The study areas are river basins in Jordan, Lebanon, Syria and Turkey. The EU Water Framework Directive provides an analytical framework to study meanings of PP in River Basin Management Plan. Grounded Theory Methodology is used to elicit understandings of both PP and WMCs via qualitative and quantitative data (questionnaires, interviews, medium-scale survey). This thesis presents grounded typologies of objectives of PP, types of PP, of WMCs, of the roles of the competent authority and of hurdles to initiate PP. Even in countries where criteria characterising a democratic society are not all entirely satisfied there is a case for promoting PP in IWM. Although an uneducated public, with poor knowledge of the far reaching consequences of WMC is seen as a hurdle to initiate PP, the evidences show the contrary: a public aspiration, readiness and willingness to express ones’ voice. Conditions to foster PP require both political stability and an open society where opinions can be formed and exchanged; but also pressure on resources and services for the public to be interested and willing to take part in water management, and for the competent authority to be willing to engage with both stakeholders and the public in order to complement experts’ understandings of complex societal problems. Public Participation is not only about the pursuit of power over the final decision, but about defining what problems are about according to different constructs of reality. The newly developed grounded typologies of objectives of PP and of types for PP help identifying appropriate forms of participatory practices in relation to the contextual water management crisis.
21
Ada, Ketchie, Nehe Meret et Shapira Hila. « For the Creative Problem-Solver : An Integrated Process of Design Thinking and Strategic Sustainable Development ». Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4208.
Texte intégralRésumé :
Since the dawn of humanity design has influenced human life. Today, facing the depletion of the socio-ecological system, increasing complex problems threaten humanity’s existence. Design has been a contributor to creating such problems, yet with appropriate tools can become a source for solutions. Design Thinking (DT) was identified as a possible approach that could contribute to Strategic Sustainable Development (SSD). The purpose of this thesis is to examine potential contributors and hindrances of the DT process with regards to SSD, and create a prototype for an integrated process that could help achieve more strategic and sustainable outcomes. With the use of the Framework for Strategic Sustainable Development (FSSD) as a lens to examine the above, along with interviews, Action Research and expert feedback, an integrated process was created. Results of the interviews and FSSD analysis helped shape two prototypes that were examined through the mentioned methods. It was indicated by participants of the Action Research and by experts that the prototype could help reach a strategic and sustainable outcome, and further refinement should be pursued. The final prototype is presented as part of the discussion, suggesting additional tools and actions that if included could create a possible Sustainable DT (SDT) process.
22
Zivojinovic, Petar, et Yustine Hendrika. « From Problem Solving to an Integrated Organizational Approach : A Continuation Study of the Diffusion of an Innovation ». Thesis, Högskolan i Halmstad, Akademin för ekonomi, teknik och naturvetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-28635.
Texte intégralRésumé :
This thesis presents a continuation study about the diffusion of innovation in the manufacturing companies. The focus of this study is the diffusion of innovation in technology and CAD is the selected technology that is widely used in the manufacturing companies. The foundation of this study is the previous work that has been conducted by Jan Löwstedt and Christer Norr in 1991 that explained about the diffusion of technology during that time. Thereafter, technology has experienced a rapid change. There is not a continuation study afterwards. The purpose of this study is to see how the technology has changed and how people use it over time, and what driving forces are behind it, so an extension information for the PLC perspective can be formed. Theoretical framework was built by analyzing the previous studies as the foundation to see what has changed over time. The concept of the diffusion of innovation, PLC, and the development of CAD in terms of technical and organizational perspective wise from several researchers are also disclosed to support the empirical findings. The approach of this study is based on a qualitative study where empirical data are collected through interviewing Swedish manufacturing companies that use CAD in their companies. The result of this study reveals that the usage of CAD technically is not dramatically changed: it is still mainly in providing a visceral visualization. But, the paradigm shifting in utilizing CAD in the organization is worth exploring. Where it is triggered by the need to get more advanced technology-wise. The diffusion of technology could contribute the paradigm shifting in the way of working. This study shows that the companies tend to maximize the result of the technology by integrating the result not exclusively only for the design department, but also for other parties such as: the engineering calculation department and customers. However, this study could present a sharper pattern if there were more companies that were in the early stage of CAD as the source of information.
23
李寶榮 et Po-wing Lee. « Integrated modern-heuristic and B/B approach for the classical traveling salesman problem on a parallel computer ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31222997.
Texte intégral
24
Lee, Po-wing. « Integrated modern-heuristic and B/B approach for the classical traveling salesman problem on a parallel computer / ». Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B21904315.
Texte intégral
25
Morganti, Luca. « Integrated process planning and scheduling (IPPS) problem : a new process-quality approach for reconfigurable manufacturing systems ». Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.
Trouver le texte intégralRésumé :
Questo lavoro tratta il problema dell’integrated process planning and scheduling (IPPS) nei sistemi di produzione riconfigurabili (RMSs). Il process planning e lo scheduling sono due importanti e complesse funzioni necessarie alla produzione delle parti. Inoltre, per ridurre la complessità del problema, gli approcci tradizionali le considerano come attività in sequenza. In questo lavoro viene considerata l’integrazione di entrambe in un unico processo e viene proposta un’euristica per la soluzione dell’IPPS in ambienti riconfigurabili. Più specificatamente, un RMS consiste in un insieme di macchine distinte per numero diverso di configurazioni e utensili. Ogni macchina può svolgere un determinato numero di operazioni in base alle sue configurazioni e alla loro disponibilità. L’obiettivo dell’euristica proposta è trovare il miglior assegnamento di operazioni alle macchine tenendo in considerazione la qualità del processo. Infine, per dimostrare l’applicabilità dell’euristica, un esempio numerico illustrativo viene presentato e i risultati discussi. Il lavoro è stato svolto nel laboratorio di informatica e sistemi (LIS) presso l’università Aix-Marseille sotto la supervisione del professor Lyes Benyoucef.
26
Devapriya, Priyantha. « Optimal fleet size of an integrated production and distribution scheduling problem for a single perishable product ». Connect to this title online, 2008. http://etd.lib.clemson.edu/documents/1211398651/.
Texte intégral
27
Itani, Maher. « Dynamics of Deprivation Cost in Last Mile Distribution The Integrated Resource Allocation and Vehicle Routing Problem ». Diss., North Dakota State University, 2014. https://hdl.handle.net/10365/27604.
Texte intégralRésumé :
One of the most critical tasks after a natural disaster is to organize and execute
humanitarian relief operations effectively and efficiently while reaching an equitable
outcome. However, due to limited resources in the initial stage of response, it becomes
challenging for logistics planning authorities to target needed individuals. The concerns
would be with providing an unbiased platform to make decisions about equitable
distribution schedules. Therefore, developing an effective and efficient disaster relief plan
that tries to treat individuals as equitable as possible was the main motivation in this
research. For this purpose, this dissertation studied a novel last mile distribution plan in the
initial response phase where the key focus is the preservation of lives. An integrated
vehicle routing and resource allocation problem was investigated and formulated in an
routing-allocation model (RAP). The theoretical foundation of RAP is formulated as an
egalitarian model where resources are to be distributed so as to maximize the welfare of
those in greatest need. The strategic goal is to alleviate human deprivation and suffering by
minimizing the response time in regard to each beneficiary?s needs fulfillment and delivery
delay on the route. Equity is quantified with a min-max objective on a deprivation cost,
which is a non-linear function of deprivation time. The objective function is set to
minimize the maximum deprivation cost of the deliveries so that supplies arrive in a
cyclical manner while all demand sites are treated equitably.Upper Great Plains Transportation Institute (UGPTI)
28
Wang, Yuqiang. « Models and Algorithms for Some Combinatorial Optimization Problems : University Course Timetabling, Facility Layout and Integrated Production-Distribution Scheduling ». Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/28757.
Texte intégralRésumé :
In this dissertation, we address three different combinatorial optimization problems (COPs), each of which has specific real-life applications. Owning to their specific nature, these problems are different from those discussed in the literature. For each of these problems, we present a mathematical programming formulation, analyze the problem to determine its useful, inherent structural properties, and develop an efficient methodology for its solution by exploiting these properties.
The first problem that we address is the course timetabling problem encountered at Virginia Tech. The course timetabling problem for a university is a difficult problem and has been studied by many researchers over the years. As a result, a plethora of models and approaches have been reported in the literature. However, most of these studies have focused on applications pertaining to course scheduling for a single or at most few departments of a university. The sheer size of the university-wide timetabling problem that we address, involving thousands of courses to be scheduled in hundreds of classrooms in each semester, makes it a challenging problem. We employ an appropriate decomposition technique that relies on some inherent structural properties of the problem both during the modeling and algorithmic development phases. We show the superiority of the schedules generated by our methodology over those that are currently being used. Also, our methodology requires only a reasonable amount of computational time in solving this large-size problem.
A facility layout problem involving arbitrary-shaped departments is the second problem that we investigate in this dissertation. We designate this problem as the arbitrary-shaped facility layout problem (ASFLP). The ASFLP deals with arranging a given set of departments (facilities, workstations, machines) within the confines of a given floor space, in order to optimize a desired metric, which invariably relates to the material handling cost. The topic of facility planning has been addressed rather extensively in the literature. However, a major limitation of most of the work reported in the literature is that they assume the shape of a department to be a rectangle (or even a square). The approach that relies on approximating an arbitrary-shaped department by a rectangle might result in an unattractive solution. The key research questions for the ASFLP are: (1) how to accurately model the arbitrary-shaped departments, and (2) how to effectively and efficiently determine the desired layout. We present a mixed-integer programming model that maintains the arbitrary shapes of the departments. We use a meta-heuristic to solve the large-size instances of the ASFLP in a reasonable amount of time.
The third problem that we investigate is a supply chain scheduling problem. This problem involves two stages of a supply chain, specifically, a manufacturer and one or more customers. The key issue is to achieve an appropriate coordination between the production and distribution functions of the manufacturer so as to minimize the sum of the shipping and job tardiness costs. We, first, address a single customer problem, and then, extend our analysis to the case of multiple customers. For the single-customer problem, we present a polynomial-time algorithm to solve it to optimality. For the multiple-customer problem, we prove that this problem is NP-hard and solve it by appropriately decomposing it into subproblems, one of which is solvable in polynomial time. We propose a branch-and-bound-based methodology for this problem that exploits its structural properties. Results of an extensive computational experimentation are presented that show the following: (1) our algorithms are efficient to use and effective to implement; and (2) significant benefits accrue as a result of integrating the production and distribution functions.Ph. D.
29
Ertem, Mustafa Alp. « Optimal Scope Of Work For International Integrated Systems ». Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606209/index.pdf.
Texte intégralRésumé :
This study develops a systems integration project scheduling model which identifies the assignment of activity responsibilities that minimizes expected project implementation cost, considering the project risk. Assignment of resources to the individual jobs comprising the project is a persistent problem in project management. Mostly, skilled labor is an essential resource and both the time and the cost incurred to perform a job depend on the resource to which job is assigned.
A systems integration project includes implementation issues in the areas of shipping, installation, and commissioning. Implementation problems lead to project delays, increased costs, and decreased performance, leading to customer dissatisfaction with the systems integrator. Activities can be performed in one of three ways: by the integrator, by the customer, or jointly between the integrator and customer. In this study we select the performer (mode) of each activity comprising the project network while taking into consideration the varying cost, duration and extreme event probability of each activity among different modes-integrator, joint work and customer.
Use of the model will permit customers and integrators to mutually agree on an appropriate assignment of responsibilities in the contract. Systems integrators can also use the model to improve their implementation services offerings. An experimental design and a Monte-Carlo simulation study were conducted to see the effects of the parameters of the problem on the selection of modes.
30
Watanabe, Henrique Hiroshi Motoyama. « Métodos de solução aplicados ao problema de produção e distribuição ». Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05122016-101153/.
Texte intégralRésumé :
Neste mestrado estudamos o problema integrado de produção e distribuição (PIPD). Ao resolver o PIPD, tenta-se obter de maneira integrada as decisões de produção, controle de estoque, distribuição e roteamento de veículos. Neste tipo de problema, em cada período, um único ou múltiplos itens são produzidos e distribuídos para os clientes com o objetivo de atender uma determinada demanda a um custo total mínimo. Ou seja, no PIPD deve-se decidir quando e quanto produzir de cada item e as rotas e distribuições de cada veículo tal que o custo final, que inclui custos de produção, estoque e distribuição, seja mínimo. Estudamos o problema e modelo matemático considerado em Armentano et al. (2011). Para tratar o PIPD propomos heurísticas baseadas em programação matemática e geramos instâncias com múltiplos itens para testar o desempenho destas heurísticas. Comparamos os resultados obtidos pelas heurísticas com o solver comercial Cplex. Os resultados mostram que algumas das abordagens propostas obtiveram soluções de boa qualidade considerando as instâncias geradas.In this work, the integrated production and vehicle routing problem (IPVRP) was studied. IPRP is solved by deciding on a integrated way the production, inventory control, distribution and vehicle routing decisions. In this type of problem, in each period, a single or multiple items are produced and distributed to costumers in order to meet a certain demand while minimizing the total cost, i.e., decide when and how much to produce of each item and the routes and distribution for each vehicle such that the final cost, which includes production, inventory and distribution costs is minimal. We considered the problem and mathematical model studied in Armentano et al. (2011). In order to deal with IPRP, heuristics based on mathematical programming were proposed together with multiple items instances to test the performance of those heuristics. We compare their results with the comercial solver Cplex. Results showed that some proposed heuristics obtained good quality solutions considering the generated instances.
31
Olsson, H. A. Joakim. « An evaluation of the Integrated Information Theory against some central problems of consciousness ». Thesis, Högskolan i Skövde, Institutionen för biovetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-11659.
Texte intégralRésumé :
This thesis evaluates the integrated information theory (IIT) by looking at how it may answer some central problems of consciousness that the author thinks any theory of consciousness should be able to explain. The problems concerned are the mind-body problem, the hard problem, the explanatory gap, the binding problem, and the problem of objectively detecting consciousness. The IIT is a computational theory of consciousness thought to explain the rise of consciousness. First the mongrel term consciousness is defined to give a clear idea of what is meant by consciousness in this thesis; followed by a presentation of the IIT, its origin, main ideas, and some implications of the theory. Thereafter the problems of consciousness will be presented, and the explanation the IIT gives will be investigated. In the discussion, some not perviously—in the thesis—discussed issues regarding the theory will be lifted. The author finds the IIT to hold explanations to each of the problems discussed. Whether the explanations are satisfying is questionable.
32
Dwivedi, Aditi. « An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income ». Ohio University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479.
Texte intégral
33
Silva, Lorrany Cristina da. « Modelos para o problema de roteamento de veículos com restrições de empacotamento bidimensional ». Universidade Federal de Goiás, 2017. http://repositorio.bc.ufg.br/tede/handle/tede/7899.
Texte intégralRésumé :
Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2017-10-20T16:09:47Z
No. of bitstreams: 2
Dissertação - Lorrany Cristina da Silva - 2017.pdf: 8394886 bytes, checksum: 9cc1461b937a65a8c50964b3dea86623 (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-10-23T10:05:52Z (GMT) No. of bitstreams: 2 Dissertação - Lorrany Cristina da Silva - 2017.pdf: 8394886 bytes, checksum: 9cc1461b937a65a8c50964b3dea86623 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-10-23T10:05:52Z (GMT). No. of bitstreams: 2 Dissertação - Lorrany Cristina da Silva - 2017.pdf: 8394886 bytes, checksum: 9cc1461b937a65a8c50964b3dea86623 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-06-28
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
Three different integer linear programming models for the Vehicle Routing Problem with Two-dimensional Loading Constraints are developed in this work. The version of the problem studied considers that the unloading of the rectangular items can respect or not the sequence of the clients visited on the route, that is, we solve the sequential and unrestricted versions of the problem. The first model deals with the problem completely, that is, with all constraints inserted at once. The second and third models are based, respectively, on a three- and two-index formulation. Separation routines are considered to detect violated inequalities related with packing on the second and third models, while the third model also considers cuts on connectivity and capacity. Computational experiments were carried out over instances of the literature with the quantity of customers ranging from 15 to 36 and items from 15 to 114, besides to consider the cases in which the cost of traversing an edge is integer and real. The models with cuts on demand were better in relation to the first model, besides being competitive when comparing with the results fromthe literature. The first model solved 4 of the 80 instances, the three-index model solved 7 and, the two-index model solved 53. On the sequential version, the adopted model solved 33 instances for the case with integer costs (and 37 for the case with real costs). In comparing with a recent heuristic from the literature, the best model was capable of tying in 48 instances in the unrestricted version and 24 in the sequential version.
Neste trabalho desenvolvem-se três modelos de programação linear inteira para o Problema de Roteamento de Veículos com Restrições de Empacotamento Bidimensional. A versão do problema estudado considera que o descarregamento dos itens retangulares pode respeitar (ou não) a sequência de clientes visitados na rota, ou seja, resolve-se as versões sequencial e irrestrita do problema. O primeiro modelo trata do problema de forma completa, isto é, com todas as restrições inseridas de uma só vez. O segundo e o terceiro modelo são baseados, respectivamente, em uma formulação de três e dois índices. Rotinas de separação são consideradas para detectar desigualdades violadas de empacotamento no segundo e no terceiro modelo, enquanto o último modelo considera também cortes de conectividade e capacidade. Experimentos computacionais foram realizados em instâncias da literatura com número de clientes variando de 15 a 36 e itens de 15 até 114, além de considerar os casos em que o custo da aresta é inteiro ou real. Os modelos com cortes sob demanda foram melhores em relação ao primeiro modelo, além de serem competitivos quando comparado com a literatura. O modelo completo encontrou a solução ótima em 4 das 80 instâncias, o modelo de três índices 7 e o modelo de dois índices 53. Na versão sequencial, o modelo adotado resolveu 33 instâncias para o custo inteiro (e 37 para o custo real). Na comparação com uma heurística recente da literatura, o melhor modelo conseguiu empatar em 48 instâncias na versão irrestrita e em 24 na versão sequencial.
34
Grover, Samir. « Solving layout compaction and wire-balancing problem using linear programming on the Monsoon multiprocessor ». Thesis, Connect to online version, 1995. http://0-wwwlib.umi.com.mercury.concordia.ca/cr/concordia/fullcit?pMQ90885.
Texte intégral
35
Koclar, Ayse. « The General Lot Sizing And Scheduling Problem With Sequence Dependent Changeovers ». Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606117/index.pdf.
Texte intégralRésumé :
In this study, we consider the General Lot Sizing and Scheduling Problem in single level capacitated environments with sequence dependent item changeovers. Process industries may be regarded as suitable application areas of the problem. The focus on capacity utilization and intensively time consuming changeovers necessitate the integration of lot sizing and sequencing decisions in the production plan.
We present a mathematical model which captures the essence of cases in the most generic and realistic setting of the problem. We discuss the impact and validity of some of the assumptions commonly encountered in the related literature. We also represent the problem using an alternative formulation and attempt to enhance the formulations with the use of some additional inequalities. Finally, we develop a heuristic by restricting the number of possible changeovers. Computational results are discussed.
36
Mirakyan, Atom. « Methodological frameworks for uncertainty analysis in long range integrated energy planning for cities and territories ». Thesis, Strasbourg, 2014. http://www.theses.fr/2014STRAD027.
Texte intégralRésumé :
La thèse propose d’abord un cadre général pour l’analyse de l’incertain durant les différentes phases du processus de planification énergétique à long terme à base de modèles de villes ou territoires (IEPCT). Il inclut des critères d’évaluation de la qualité d’une démarche IEPCT. Puis deux méthodes d’analyses de l’incertain sont proposées pour les activités de modélisation et de scénarisation du système énergétique : l’une basée sur l’échantillonnage aléatoire (PRSUA) et l’autre sur les scénarios flous (FSUA). Leur implémentation sur des cas a permis de montrer leur faisabilité et leur performance du point de vue des critères de qualité. La méthode PRSUA est plus gourmande en données, elle est plus adaptée à la planification sectorielle court moyen terme et tandis que FSUA convient plus à la planification long terme intersectorielle.Enfin une méthode pour la réalisation de l’ensemble des activités liées à la structuration d’un problème de planification spécifique (IMMA) est proposéeThe Phd first proposes a methodological framework for addressing different types of uncertainty within long range ntegrated energy planning for cities and territories (IEPCT) processes which includes requirements and quality factors. Second, two methods for uncertainty analysis of modelling tasks are proposed. One approach is probabilistic random sampling approach (PRSUA) another one is fuzzy scenario approach (FSUA). Compared to FSUA, the PRSUA framework is more data intensive. PRSUA is more suitable for short or midterm sector specific domain analysis, FSUA is more appropriate for long range cross sectoral integrated planning.Third it is proposed an innovative approach (IMMA) for supporting not only uncertainties in IEPCT first phase but also all other tasks relevant to this planning phase. Implementation of IMMA in Singapore shows that it can address all identified tasks and help developing requirements for innovative solutions
37
Chen, Chiao-Yi, et 陳巧頤. « The Integrated Circuit Packaging Scheduling Problem ». Thesis, 2000. http://ndltd.ncl.edu.tw/handle/70176953994726557975.
Texte intégralRésumé :
碩士國立交通大學
工業工程與管理系
88
The integrated circuit packaging scheduling problem (ICPSP) is a variation of the flexible flow-shop scheduling problem, which is also a generalization of the classical flow-shop and the identical parallel-machine problems. In the integrated circuit (IC) packaging factories, the jobs are clustered by the product types, which require multiple process stage operations on a series of identical parallel machines according to the manufacturing sequences. The final operation must be completed before the due dates. The job processing time at each process stage may vary, depending on the product type of the job processed on. At each process stage, setup times between two consecutive jobs of different product types (job clusters) on the same machines are sequentially dependent. The ICPSP involves constraints on job clusters, job-cluster dependent processing time, due dates, machine capacity, sequentially dependent setup time, and the manufacturing sequences. The problem is, therefore, considerably more difficult to solve than the classical flow-shop scheduling and the parallel-machine scheduling problem which have been investigated extensively. In this research, we formulate the ICPSP as an IP problem to minimize the total machine workload. We demonstrate the applicability of the IP model by solving a real-world example taken from an IC packaging factory. And we also present a case study on the ICPSP, which is taken from an IC packaging factory located on the Industrial Park in Taichung, Taiwan, which covers all the manufacturing process stages where the total machine workload needs to be minimized. Our investigation considers all the constraints, thus accommodates the real situations more closely than those investigated in the existing literatures. We also presented two efficient solution procedures, called the Multiple-Stage Sequential Savings algorithm and the Multi-Stage Parallel Insertion algorithm to solve the ICPSP case, which minimizes the total machine workload. Details of the schedules for the eleven stages, and the workload for each individual machine are provided.
38
Chen, An-Yi, et 陳安怡. « The Integrated Circuit Final Testing Scheduling Problem ». Thesis, 2001. http://ndltd.ncl.edu.tw/handle/39117335173370137729.
Texte intégralRésumé :
碩士國立交通大學
工業工程與管理系
89
The integrated-circuit final testing scheduling problem (ICFTSP) with reentry, is a variation of the complex flow-shop scheduling problem, which is also a generalization of the classical reentrant flow batch process, and the identical parallel machine problem. In the integrated-circuit (IC) final testing factories, the jobs are clustered by their product types, which must be processed on groups of parallel machines at various process stages following the manufacturing sequence, which must be completed before the due dates. The job processing time depends on the product type, and the machine setup time is sequentially dependent on the orders of jobs processed. Since the ICFTSP with reentry has reentry characteristic, and involves job processing precedence, serial stage, batch stage, job clusters, job-cluster dependent processing time, due dates, machine capacity, and sequence dependent setup time, it is more difficult to solve than the classical flow-shop scheduling problem and the parallel-machine scheduling problem which have been investigated extensively. In this research, we consider a more general version of ICFTSP with reentrant flow lines and each job cluster containing multiple jobs. We formulate the ICFTSP as an integer programming problem to minimize the total machine workload that can represent the utilization rate interested by manufacturer in the semiconductor industry. To illustrate the applicability of the linear integer programming model, we run the integer programming model using the IP software CPLEX 6.0 to solve a small ICFTSP example. And We present a case study on ICFTSP, which is taken from am IC final testing factory located on the Industrial Park in Hsin-Chu, Taiwan, covering all manufacturing process stages (serial and batch processing) where the total machine workload is minimized. We also present two fast network algorithms to efficiently solve the ICFTSP with reentry. Details of the schedules for this case, and the workload for each individual machine are provided.
39
Kuo, Hsien-Jung, et 郭憲融. « Construction of Integrated Problem Solving Model－I8D ». Thesis, 2014. http://ndltd.ncl.edu.tw/handle/18635218440115342424.
Texte intégralRésumé :
碩士中原大學
工業工程研究所
102
This paper attempted to establish an “Integrated Problem Solving Model,” which is named “Integrated 8 Disciplines－I8D.” This model combined improvement steps and techniques including QC Story, Lean, Six-sigma and 8D. In addition, this system applied TRIZ (Theory of Inventive Problem Solving) tools to construct a quick and valuable problem solving model. By adopting I8D to the semiconductor manufacturing company as case study, the result indicated the yield rate of 3D IC, and modified the original 8D processes. To conclude, this paper proved that integrated model could bring benefits to the case study, by employing this model’s feasibility to reform its weaknesses and to upgrade its strengths.
40
Yeh, Su-Wei, et 葉書瑋. « Integrated Routing Cost With The Joint Replenishment Problem ». Thesis, 2012. http://ndltd.ncl.edu.tw/handle/80331854308356347081.
Texte intégralRésumé :
碩士國立雲林科技大學
工業工程與管理研究所碩士班
100
Traditional joint replenishment problem is based on a second-order supply chain, which is for the multiple retailers and a suppliers common replenishment. In the past, joint replenishment problem and transport routing problem have always been the separate problems but in fact these two problems are inseparable. Thus the research we have here is trying to combine two different NP-hard problem which is ‘Joint Replenishment Problem，JRP’ and ‘traveling salesman problem，TSP’ each accordingly. The result comes out with us using Goyal’s systematic concept of Brute-force attack and then the routing costs added in afterwards. Since the TSP is also one of NP’s problem, the research will use simulation annealing method to calculate the shortest routing costs, wishing to combine each two cost to a balance so as to lower the costs. In this research,we can discover the uni routing cost is the most important factor,and the major ordering cost and the unit holding cost isn’t that important. But if the major ordering cost and the unit holding cost are opposite level,it will make the degree of holding cost increase less.Therefore,we can make the order of importance for this model that the first important is the unit routing cost,and the second important is whether the major ordering cost and the unit holding cost are opposite level.
41
李曉真. « An Integrated Algorithm for TRIZ Inventive Problem Solving ». Thesis, 2013. http://ndltd.ncl.edu.tw/handle/30086065569028076020.
Texte intégralRésumé :
碩士國立清華大學
工業工程與工程管理學系
101
This research established an integrated problem solving process which integrated many TRIZ (Theory of Inventive Problem Solving) tools and some non-TRIZ tools for systematic problem solving. The process includes five stages: (1) Problem Definition; (2) Problem Analysis; (3) Solution Generations; (4) Solution Selection and Integration; and (5) Solution Verification. This structured problem solving process could help problem solvers to solve problem effectively by aiming at solving of the critical key disadvantage(s). In addition to the traditional TRIZ tools, the process uses Pugh Matrix to select and integrate solutions from a plurality of solutions to obtain a set of integrated best solution. Afterwards, applying Super-Effect Analysis can maximize the effectiveness of the solution. The algorithm of virtual verification through rigorous cause-effect inference can logically verify that the expected goal can be achieved, and the secondary problem can also be detected facilitating problem solving. The contributions of this research include: 1) Establishing an integrated and sys-tematic problem solving process which provide various channels and guide users to solve the problem systematically; 2) Integrating the TRIZ problem solving with “Solution Selection and Integration” and “Solution Verification” substantiating the detail steps for the rear part of ARIZ; 3) Establishing the forms for the full process, including designing the forms for Super-Effect Analysis and Solution verification process.
42
Yeh, Che-Cheng, et 葉哲誠. « Integrated transportation planning with the joint replenishment problem ». Thesis, 2008. http://ndltd.ncl.edu.tw/handle/15585242786983472718.
Texte intégralRésumé :
碩士雲林科技大學
工業工程與管理研究所碩士班
96
In two echelon distribution system, common replenishment of single-supplier and multi-retailer is so-called Joint Replenishment Problem (JRP). In traditional distribution system, replenishment decision and transportation planning are decided separately. That means inventory cost and transportation cost are calculated separately - replenishment decision minimizes inventory cost (ordering cost and holding cost) and transportation planning minimizes transportation cost. As oil price increased, the transportation cost raised. The replenishment policy is made firstly and the transportation routing is decided secondly will cause higher transportation cost. This research will re-formulate the replenishment policy of distribution system with consideration of the transportation cost and minimize the ordering cost, holding cost and transportation cost. The total costs of traditional model and this research’s model will be compared. Under different distribution environment, different distribution models are used to find the minimum total cost. Because joint replenishment and transportation planning which use the Traveling Salesman Problem (TSP) is NP problem, we can adopt meta-heuristic algorithm to find solution. The genetic algorithm is used to find solution of joint replenishment model and the simulated annealing algorithm is used to calculate the shortest path of TSP in the transportation planning. According to the experiment, we find that when the sale points cluster with high demand and high unit transportation cost, the policy of distribution system with consideration of three costs together is better than the policy which considers replenishment cost and transportation cost separately. It saves more total cost. By the replenishment policy formulating, the transportation cost is raised because of the more frequencies of conveyances to farther sale points.
43
楊智斌. « An integrated knowledge acquisition and problem solving model for experience-oriented problems in construction management ». Thesis, 1997. http://ndltd.ncl.edu.tw/handle/94743235142625791144.
Texte intégral
44
Deek, Fadi Pierre. « An integrated environment for problem solving and program development ». 1997. http://catalog.hathitrust.org/api/volumes/oclc/39279108.html.
Texte intégral
45
Lu, Chih-Hang, et 呂志航. « An integrated approach for the vending machine replenishment problem ». Thesis, 2007. http://ndltd.ncl.edu.tw/handle/00210142170364400881.
Texte intégralRésumé :
碩士國立高雄第一科技大學
運籌管理所
95
In this paper we present a model and solution procedures for the vending machine replenishment problem encountered in vending machine supply chains utilizing vendor-managed inventory (VMI) scheme. The model is a modification of the existing Periodic Vehicle Routing Problem (PVRP). Our model is different from from previous research in that the replenishment period is not fixed and its objective is to minimize the sum of the shortage cost and traveling costs during a given time period. The proposed model belongs to the class of NP-hard problems since it includes the vehicle routing problem as a subproblem. It is difficult to solve this problem to optimality within a reasonable time period. Thus,we developed a Simulated Annealing (SA) heuristic for this problem by. The SA treats the replenishment frequency of each vending machine as a decision variable instead of a fixed parameter. It optimizes the replenishment frequencies of vending machines and vehicle routes simultaneously in order to find the best trade-off between the shortage and transporataion costs. This new approach can reduce the total shortage and transporation cost by 10 to 20%, as indicated by the computational study.
46
Karoonsoontawong, Ampol. « Robustness approach to the integrated network design problem, signal optimization and dynamic traffic assignment problem ». Thesis, 2006. http://hdl.handle.net/2152/2902.
Texte intégral
47
Hong, Bo-Sheng, et 洪博勝. « Integrated Planning Mode for Precast Segment Production and Erection Problem ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/28509909864834353730.
Texte intégralRésumé :
碩士國立雲林科技大學
營建工程系碩士班
93
Casting and erection are the critical activities in the construction procedure of precast segmental concrete bridge. In general, the casting method of segments can be divided into two types, long-bed casting method as well as short-bed casting method. Both methods are different in casting procedure and have their own advantages and disadvantages. Therefore, for a project, the casting method has to be decided before the casting yard is arranged and set up. There are two construction methods of viaduct applying the same production pattern but different in the erection. They are precast segments and full span methods, and the basic difference is the longitudinal layout of prestress. The research based on the precast segments erection method focuses on the following topics. 1.The collection and review of the development of Linear and Integer Programming 2.The actual operation experience and relative references 3.The time table of the production of precast segments and erection 4.Construction efficiency analysis deviation, change of weather, malfunction of machine and construction characters based on the consideration of inventory theory 5.An establishment of the Integrated Programming mode 6.The satisfaction of the restricted completion condition of on time schedule solved by the ILOG OPL Studio software 7.The target of minimum total cost 8.The built-up of a optimum planning mode
48
Chang, Teng-Kai, et 張登凱. « Column Generation Appoach to Integrated Production and Distribution Scheduling Problem ». Thesis, 2008. http://ndltd.ncl.edu.tw/handle/29416904468159760618.
Texte intégralRésumé :
碩士國立交通大學
工業工程與管理系所
96
More and more enterprises have chosen to adopt make-to-order business model in order to satisfy diversified and rapidly-changing customer demand. In such a business model, enterprises have to focus on reducing their inventory level in order to be competitive. The reduction of inventory level and short lead time forces the operation between production and distribution to cooperate closely thus increases the practicability of integrating the production and distribution stages. This research studies an integrated production and distribution scheduling problem in which the production stage is modeled by an identical parallel machine scheduling problem and the distribution stage is modeled by a capacitated vehicle routing problem. Given a set of customer orders (jobs), the problem is to find a joint production and distribution schedule such that the weighted summation of total job weighted completion time and total job delivering cost is minimized. The studied problem was first formulated as an integer program, and then solved by using column generation techniques in conjunction with a branch-and-bound approach to optimality. The results of the computational experiments indicate that the proposed approach can solve most of the test problems to optimality. Besides, the average gap between the optimal solutions and the lower bounds are no more than 1.29% for these test problems.
49
Cheng, Ya-Yin, et 鄭雅尹. « Integrated pick-up and delivery problem for 3C products intermediaries ». Thesis, 2004. http://ndltd.ncl.edu.tw/handle/16890080402151448021.
Texte intégralRésumé :
碩士南台科技大學
行銷與流通管理系
92
ABSTRACT For reaching the diverse demand of customers, 3C(computer、communication、consumer electronics) products retails need strong logistics supports from the 3C intermediaries. In order to provide better service, the 3C intermediaries have to consider the physical attributes and the repairing/recycling requirement of 3C products when they design the pick up and delivery routes. This research makes an attempt to explore the nature of practical logistics operations of 3C intermediaries, also an optimization model will be formulated to assist the designing of service routes of 3C intermediaries. According to the preliminary study, the service routes design problem of 3C intermediaries can be viewed as a multi-commodity network design problem which takes both the vehicle flows and commodity flows into account. The mathematical programming model will be modified as well as evaluated by some test cases. Furthermore, a real-world case appreciation of this model will be studied.
50
Chen, Hsuan-an, et 陳璿安. « A study on an integrated scheduling problem of production and distribution ». Thesis, 2010. http://ndltd.ncl.edu.tw/handle/56678321959082490922.
Texte intégralRésumé :
碩士雲林科技大學
工業工程與管理研究所碩士班
98
Production and distribution are the most important activities in supply chain. Firms can provide products that customers need at the right moment with tight integrated between production and distribution. Also, the inventory cost of both sides, firms and customers, can be lowered and the benefits of the whole supply chain can be improved. Among the past studies, production and distribution were usually studied separately. So the researcher studied a scheduling problem that integrated flow shop and vehicle routing. Genetic algorithm is a meta heuristic that searches many solutions at the same time, and it has been successfully applied to different fields since 1975. Also, hybrid genetic algorithm can be applied to both flow shop scheduling and vehicle routing problems and the outcome of solution is fine. Therefore, the researcher applied adaptive genetic algorithm to the integrated problem of production and distribution and compared the outcome of solutions with the one of genetic algorithm. The result revealed that best approximate solutions could be obtained during reasonable time and the solving outcomes of adaptive genetic algorithm was better than that of genetic algorithm. The researcher also the connection among unit inventory cost, unit distribution cost and the distribution strategy of firms. The result revealed that the orders were distributed separately under the circumstances of high inventory cost, with more cars were used to distribute orders.