To see the other types of publications on this topic, follow the link: Production scheduling. Flexible manufacturing systems.
Dissertations / Theses on the topic 'Production scheduling. Flexible manufacturing systems'
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 'Production scheduling. Flexible manufacturing systems.'
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
Doulgeri, Z. "Production scheduling policy for flexible manufacturing systems." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38292.
Full text
2
Hsu, Chih-hua. "Dynamic scheduling of manufacturing systems /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Full text
3
丘杰 and Jie Qiu. "Scheduling flexible manufacturing systems using fuzzy heuristics." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B31244671.
Full text
4
Ghosh, Soumen. "Production planning and scheduling in a flexible manufacturing system environment." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1272384308.
Full text
5
Fenchel, Juergen. "Stable, distributed real-time scheduling of flexible manufacturing systems : an energy approach." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/16774.
Full text
6
Hassanzadeh, Mostafai Pejman. "Rescheduling point determination in dynamic FMS using a flexibility metric methodology /." View online ; access limited to URI, 2007. http://0-digitalcommons.uri.edu.helin.uri.edu/dissertations/AAI3298369.
Full text
7
Stallworth, Thomas Earl. "A forward scheduling heuristic for real time control of a flexible manufacturing system." Thesis, Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/24095.
Full text
8
Chung, Sai-ho. "A genetic algorithm approach in distributed scheduling in multi-factory production networks." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37826773.
Full text
9
Quadt, Daniel. "Lot-sizing and scheduling for flexible flow lines /." Berlin : Springer, 2004. http://www.loc.gov/catdir/toc/fy0602/2004109270.html.
Full text
10
Chen, Chin-Sheng. "Methodologies for manufacturing system selection and for planning and operation of a flexible manufacturing system." Diss., Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/54242.
Full textAbstract:
A hierarchical methodology is developed for the overall design of manufacturing systems. The methodology consists of solutions to four levels of problems, namely, (1) manufacturing system selection, (2) shop loading, (3) machine loading and tool allocation, and (4) testing the feasibility of a schedule and determining strategies for the operational control of the system. Although these problem levels are developed in a hierarchical sense, they can be applied independently by assuming appropriate inputs to the problem level under consideration. The third and the fourth level problems are addressed in this research for the flexible manufacturing system.
The first level of the hierarchical methodology addresses the problem of manufacturing system selection. The mathematical 4 model formulated for this problem captures the basic and integrated relationships among the systems and system components. This model provides a practical approach and a precise tool to determine an optimal mix of systems, to assign appropriate machines to each system, and to select the best material handling system for each system to best suit long-term production requirements at minimum costs. The second level of the hierarchical methodology addresses the shop loading problem. A mathematical model is developed for partitioning parts among the manufacturing systems selected at the first level to minimize total operating costs. For the third level problem, a mathematical model is formulated to obtain routings of parts through an FMS and to assign appropriate cutting tools to each machine in the system to minimize total machining cost. For the fourth level problem, a simulation model is developed for testing the feasibility of the solution obtained at the third level. It also helps to determine strategies for the operational control of the system.
The computational experience with the mathematical models is presented using the MPSX-MIP/370 package. Sensitivity analysis is also performed to further understand system behavior under various operating conditions. Several new findings of the research are reported. Because of the special structure of the mathematical models, a computational refinement for their solution is also proposed based on Lagrangian relaxation.<br>Ph. D.
11
Young-On, Harold. "FMS performance versus WIP under different scheduling rules." Master's thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-12162009-020059/.
Full text
12
Chung, Sai-ho, and 鍾世豪. "A genetic algorithm approach in distributed scheduling in multi-factory production networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37826773.
Full text
13
Wu, Zuobao. "Multi-agent workload control and flexible job shop scheduling." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001193.
Full text
14
Uluer, Muhtar Ural. "Development Of A Bidding Algorithm Used In An Agent-based Shop-floor Control System." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608141/index.pdf.
Full textAbstract:
In this study a time based bidding framework is developed which is used for dispatching jobs to manufacturing resources in a virtual shop-floor environment. Agent-based shop-floor control approach is implemented with machine and part agents. The Contract-net communication protocol is utilized as the negotiation scheme between these agents. Single step product reservation (SSPR) technique is adopted throughout the study. Primary objective is determined as meeting the due dates and if the lateness is inevitable, avoiding the parts of high priority from being late. A balanced machine utilization rate is set as the secondary objective.
During bid construction step, the SSPR technique is augmented with W(SPT+CR) sequencing rule in order to obtain weighted tardiness results. Bids containing Earliest Finishing Time (EFT) and machine loading values of the corresponding machine are evaluated with considering the priority of the part. An elimination algorithm which discards the highly deviated bids having obvious differences is implemented at the initial stage of the bid evaluation step. A basic algorithm to control the maximum tardiness value is applied, as well.
A simulation test bed is developed in order to implement the time concept into the presented bidding framework. The test bed is mainly based on the Computer Integrated Manufacturing Laboratory (CIMLAB) located in Middle East Technical University, Department of Mechanical Engineering.
The developed bidding algorithm is tested under several cases. Results revealed that the proposed bidding framework was quite successful in meeting the objectives. The study is concluded with some specific future work, outlined in the light of the results obtained.
15
De, Smet Olivier. "Contribution à la planification et à l'ordonnancement de systèmes flexibles de production sujets à pannes." Cachan, Ecole normale supérieure, 1995. http://www.theses.fr/1995DENS0009.
Full textAbstract:
Dans ce mémoire, on étudie le problème de la gestion de systèmes de production sujets à pannes. Les approches utilisant une structure de commande hiérarchisée font apparaitre les niveaux planification et ordonnancement, mais elles prennent rarement en compte les pannes des le niveau de la planification. Nous proposons une nouvelle approche basée sur une structure de commande hiérarchisée utilisant un modèle à flux pour la partie planification et une méthode de recherche par faisceaux pour la partie ordonnancement. Le modèle a flux propose permet d'intégrer les pannes des l'équation d'évolution par l'utilisation de sauts markoviens décrivant l'évolution du système entre ses différents états possibles. On associe alors une fonction cout quadratique exprimant différents couts (de stockage, de production) et en partie les contraintes de capacités du système. La résolution du problème de commande optimale ainsi obtenu conduit a un ensemble d'équations matricielles couplées de type Riccati. Nous donnons alors une condition nécessaire et suffisante pour l'existence d'une solution. Nous proposons aussi un algorithme de résolution permettant d'obtenir les taux de production optimaux pour chaque type de produits dans tous les modes du systeme. Le combinatoire pour la production de pièces sur un systeme flexible pouvant devenir exagéré, nous introduisons un concept de filières permettant de réduire la taille du problème tout en conservant une relative flexibilité pour son fonctionnement. L'ordonnancement de la production sur des systemes de ce type nécessite une réaction rapide, c'est pourquoi nous proposons un ordonnancement temps réel base sur une recherche par faisceaux permettant de suivre au mieux les taux calcules par le niveau planification. Pour valider notre approche, une maquette informatique écrite en langage c a été développée et permet de simuler l'évolution d'un système de production. Deux exemples de systèmes sont traités, l'un compose de 9 machines avec 6 produits et l'autre de 6 machines et 3 produits.
16
Domingos, Jean Carlos. "Proposta de um procedimento de programação on-line da produção de sistemas flexíveis de manufatura baseado em lógica fuzzy." Universidade Federal de São Carlos, 2004. https://repositorio.ufscar.br/handle/ufscar/606.
Full textAbstract:
Made available in DSpace on 2016-06-02T19:06:23Z (GMT). No. of bitstreams: 1
DissJCD.pdf: 3954079 bytes, checksum: 63ef4f081a962ca21478327fb623632d (MD5)
Previous issue date: 2004-08-25<br>Flexible manufacturing systems (FMS) have been designed to meet market
requirements that demand products that are quality and ready to deliver. In order to
meet the market requirements, the methodologies used in the FMS scheduling must
consider a highly dynamic environment, where it is often necessary to meet or to react
to uncertain demands and to get better use of its resources. An on-line scheduling
procedure based on fuzzy logic is proposed in this work, whose main characteristic is
shop floor tasks scheduling using fuzzy rules building with the support of an expert to
meet several measures of performance. A simulation study was carried out with the
objective to verify the applicability of the proposed approach, using a simulation tool
integrated with the on-line scheduling procedure based on fuzzy logic.<br>Os sistemas flexíveis de manufatura (FMS) têm sido projetados para atender as
necessidades do mercado, que demandam por produtos que apresentam qualidade e
prazos de entrega pequenos. Para atender as necessidades do mercado, as metodologias
usadas na programação de operações de FMS devem considerar um ambiente altamente
dinâmico, onde é frequentemente necessário atender ou reagir a demandas incertas e
fazer o melhor uso de seus recursos. Um procedimento de programação on-line baseado
em lógica fuzzy é proposto neste trabalho, cuja característica principal é programar as
tarefas do chão de fábrica utilizando regras fuzzy construídas com o apoio de um
especialista para atender a várias medidas de desempenho simultaneamente. Um estudo
por meio de simulação foi realizado com o objetivo de verificar a aplicabilidade da
abordagem proposta, utilizando uma ferramenta de simulação integrada ao
procedimento de programação on-line baseado em lógica fuzzy.
17
Whitehead, Jonathan David. "Scheduling and layout in flexible manufacturing systems." Thesis, University of Southampton, 2002. https://eprints.soton.ac.uk/50617/.
Full textAbstract:
This thesis covers a variety of inter-related scheduling and layout issues encountered in flexible manufacturing systems. The principal focus is upon systems which adopt the commonly implemented loop layout configuration. A pivotal idea behind the work is that products must revisit machines during their manufacture. The work encompasses both computational and theoretical results. The computational work consists of testing both new and standard heuristic and local search techniques on two strongly NP-hard combinatorial optimisation problems, one related to layout and the other to single machine scheduling. In the layout problem, machines must be sequenced around a loop of conveyor belt with the objective of minimising the amount of movement carried out by the worst affected product type within the manufacturing system. In the single machine scheduling problem, coupledoperation jobs must be scheduled so that the maximum completion time on the machine, the makespan, is minimised; each coupled-operation job consists of two arbitrary processing time operations separated by a time lag that is bounded both below and above. Our results suggest that local search techniques, while well suited to standard search spaces, do not perform well when the search space contains infeasible neighbours and the cost of evaluating candidate solutions is high. The theoretical work stems from the repetitive manufacture of single product types in loop layout flexible manufacturing systems. We demonstrate that in such a system, the efficiency is strongly governed by the balance of workloads on the machines. We develop mixed integer programming models for tool allocation and machine sequencing with the objective of balancing workloads, and as a secondary criterion, minimising product movement. Focusing on a single machine, we study the computational complexity of a class of coupled-operation scheduling problems; each job consists of two unit processing time operations separated by a fixed delay of two units of time, and their order of production is restricted by precedence constraints. For several standard scheduling objective functions, we provide either polynomial algorithms or proof of NP-hardness for parallel chain and tree precedence constraints.
18
Cross, Fionnuala Mary. "A model for loading and sequencing a flexible manufacturing cell." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25656.
Full text
19
Audsley, Neil C. "Flexible scheduling of hard real-time systems." Thesis, University of York, 1993. http://etheses.whiterose.ac.uk/10925/.
Full text
20
Chutima, Parames. "Real-time operational control of flexible manufacturing systems." Thesis, University of Nottingham, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283404.
Full text
21
Chan, T. S. "Heuristic scheduling algorithms for dedicated and flexible manufacturing systems." Thesis, Imperial College London, 1986. http://hdl.handle.net/10044/1/37964.
Full text
22
Dadone, Paolo. "Fuzzy Control of Flexible Manufacturing Systems." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36531.
Full textAbstract:
<p> Flexible manufacturing systems (FMS) are production systems consisting of
identical multipurpose numerically controlled machines (workstations), automated
material handling system, tools, load and unload stations, inspection stations, storage
areas and a hierarchical control system. The latter has the task of coordinating and
integrating all the components of the whole system for automatic operations. A
particular characteristic of FMSs is their complexity along with the difficulties in
building analytical models that capture the system in all its important aspects. Thus
optimal control strategies, or at least good ones, are hard to find and the full potential
of manufacturing systems is not completely exploited.</p><p>
The complexity of these systems induces a division of the control approaches
based on the time frame they are referred to: long, medium and short term. This thesis
addresses the short-term control of a FMS. The objective is to define control strategies,
based on system state feedback, that fully exploit the flexibility built into those systems.
Difficulties arise since the metrics that have to be minimized are often conflicting and
some kind of trade-offs must be made using "common sense". The problem constraints
are often expressed in a rigid and "crisp" way while their nature is more "fuzzy" and
the search for an analytical optimum does not always reflect production needs. Indeed,
practical and production oriented approaches are more geared toward a good and
robust solution.</p><p>
This thesis addresses the above mentioned problems proposing a fuzzy scheduler
and a reinforcement-learning approach to tune its parameters. The learning procedure
is based on evolutionary programming techniques and uses a performance index that
contains the degree of satisfaction of multiple and possibly conflicting objectives. This
approach addresses the design of the controller by means of language directives coming
from the management, thus not requiring any particular interface between management
and designers.</p><p>
The performances of the fuzzy scheduler are then compared to those of
commonly used heuristic rules. The results show some improvement offered by fuzzy
techniques in scheduling that, along with ease of design, make their applicability
promising. Moreover, fuzzy techniques are effective in reducing system congestion as
is also shown by slower performance degradation than heuristics for decreasing inter-
arrival time of orders. Finally, the proposed paradigm could be extended for on-line
adaptation of the scheduler, thus fully responding to the flexibility needs of FMSs.</p><br>Master of Science
23
王日昇 and Yat-sing Wong. "Production scheduling for virtual cellular manufacturing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31239468.
Full text
24
Wong, Yat-sing. "Production scheduling for virtual cellular manufacturing systems /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20720841.
Full text
25
Granados, Fernández Víctor Hugo. "Modelling and optimization of flexible manufacturing systems." Master's thesis, Instituto Politécnico de Bragança, Escola Superior de Tecnologia e Gestão, 2012. http://hdl.handle.net/10198/7982.
Full textAbstract:
The Lagrangian relaxation method for solving a Mixed-Integer Linear Problem was implemented
in order to improve the current TEMPO-PSI team exible manufacturing system
solutions, available at the AIP-primeca pole in University of Valenciennes, France.
The MILP optimization model, from TEMPO-PSI team, can not guarantee good
results when the amount of jobs in the manufacturing system increases due to the growth
in the number of variables of the model.
A study on the optimization model was conducted with the objective to nd the
candidate constraints for Lagrangian relaxation. A comparative study is made between
the initial model solutions and Lagrange-relaxed model solutions.
The results of the present research indicate that the use of the Lagrangian relaxation
method on the scheduling problems could have advantages in obtaining better solutions. Um método relaxação lagrangeana para resolver um problema de Programação Misto-
Inteira Linear foi implementado com o objetivo de melhorar as soluções actuais dos sistemas
de manufatura exíveis da equipa TEMPO-PSI, disponível no laboratório AIPprimeca
da Universidade de Valenciennes, França.
O modelo de optimização MILP, da equipa TEMPO-PSI, não consegue garantir bons
resultados quando a quantidade de operações no sistema de manufactura aumenta, devido
ao crescimento do número de variáveis do modelo.
O estudo do modelo de optimização foi levado a cabo com o objectivo de encontrar
as restrições candidatas para a relaxação Lagrangeana. O estudo comparativo é feito
entre as soluções iniciais do modelo e as soluções do modelo relaxado com o método de
Lagrange.
Os resultados da presente investigação indicam que o uso de método da relaxação
Lagrangeana nos problemas de escalonamento de tarefas poderá ter vantagens na obtenção
de melhores soluções.
26
Badr, Iman [Verfasser]. "Agent-based dynamic scheduling for flexible manufacturing systems / Iman Badr." Aachen : Shaker, 2011. http://d-nb.info/1010568159/34.
Full text
27
马俊 and Jun Ma. "Dynamic production scheduling in virtual cellular manufacturing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hdl.handle.net/10722/193066.
Full textAbstract:
Manufacturing companies must constantly improve productivity to respond to dynamic changes in customer demand in order to maintain their competitiveness and marketshares. This requires manufacturers to adopt more efficient methodologies to design and control their manufacturing systems. In recent decades, virtual cellular manufacturing (VCM), as an advanced manufacturing concept, has attracted increasing attention in the research community, because traditional cellular manufacturing is inadequate when operating in a highly dynamic manufacturing environment. Virtual cellular manufacturing temporarily and dynamically groups production resources to form virtual cells according to production requirements, thus enjoying high production efficiency and flexibility simultaneously. The objective of this research is to develop cost-effective methodologies for manufacturing cell formation and production scheduling in virtual cellular manufacturing systems (VCMSs), operating in single-period/multi-period, and dynamic manufacturing environments.
In this research, two mathematical models are developed to describe the characteristics of VCMSs operating under a single-period and a multi-period manufacturing environment respectively. These models aim to develop production schedules to minimize the total manufacturing cost incurred in manufacturing products for the entire planning horizon, taking into consideration many practical constraints such as workforce requirements, effective capacities of production resources, and delivery due dates of orders. In the multi-period case, worker training is also considered and factors affecting worker training are analyzed in detail.
This research also develops a novel hybrid algorithm to solve complex production scheduling problems optimally for VCMSs. The hybrid algorithm is based on the techniques of discrete particle swarm optimization, ant colony system and constraint programming. Its framework is discrete particle swarm optimization which can locate good production schedules quickly. To prevent the optimization process being trapped into a local optimum, concepts of ant colony system and constraint programming are incorporated into the framework to greatly enhance the exploration and exploitation of the solution space, thus ensuring better quality production schedules. Sensitivity analyses of the key parameters of the hybrid algorithm are also conducted in detail to provide a theoretical foundation which shows that the developed hybrid algorithm is indeed an excellent optimization tool for production scheduling in VCMSs.
In practice, the occurrence of unpredictable events such as breakdown of machines, change in the status of orders and absenteeism of workers will make the current production schedule infeasible. A new feasible production schedule may therefore need to be generated rapidly to ensure smooth manufacturing operations. This research develops several cost-effective production rescheduling strategies for VCMSs operating under different dynamic manufacturing environments. These strategies facilitates the determination of when-to and how-to take rescheduling actions. To further enhance the performance of such strategies in generating new production schedules, especially for large-scale manufacturing systems, a parallel approach is established to implement the developed hybrid algorithm on GPU with compute unified device architecture.
The convergence characteristics of the proposed hybrid algorithm are also studied theoretically by using probability theory and Markov chain model. The analysis results show that the optimization process will eventually converge to the global optimal solution.<br>published_or_final_version<br>Industrial and Manufacturing Systems Engineering<br>Doctoral<br>Doctor of Philosophy
28
Hatzikonstantis, Leonidas. "Heuristic strategies for scheduling of cellular manufacturing systems." Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339274.
Full text
29
Liu, Jiyin. "A general structured appproach to scheduling problems in flexible manufacturing systems." Thesis, University of Nottingham, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357910.
Full text
30
Burgess, Kevin. "Stability and performance analysis of scheduling policies for flexible manufacturing systems /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487862972136559.
Full text
31
Fonseca, Marcos Abraão de Souza. "Uma abordagem ACO para a programação reativa da produção." Universidade Federal de São Carlos, 2010. https://repositorio.ufscar.br/handle/ufscar/454.
Full textAbstract:
Made available in DSpace on 2016-06-02T19:05:47Z (GMT). No. of bitstreams: 1
3340.pdf: 982188 bytes, checksum: 49ba39146aa7542a1670dd3d90507739 (MD5)
Previous issue date: 2010-06-28<br>Financiadora de Estudos e Projetos<br>In the context of automated manufacturing systems, combinatorial optimization problems, such as determining the production schedule, have been focused in many studies due to the high degree of complexity to their resolution. Several studies point to use of metaheuristics for the problem dealt, where different approaches perspectives have been proposed in order to find good solutions in a short time. In this paper, we propose an approach based on Ant Colony Optimization metaheuristic (ACO) for the reactive production scheduling problem in an FMS aiming the combination of problem characteristics with metaheuristic characteristics. For this, the problem is addressed from two perspectives, based on modeling and the search method. The problem representation is characterized by a description of the problem at the operations level, since the production schedule is included in this context. On the model is applied a constructive search method based on ACO that using the collaboration principle, establishing a relationship between operations so that it lead the search for promising regions of the solution space. The goal of this work is to obtain a reactive programming in acceptable response time in order to minimize the makespan values. Experimental results showed an improvement of the results obtained so far by other approaches.<br>No contexto de Sistemas Automatizados de Manufatura, problemas de otimização combinatória, como determinar a programação da produção, têm sido foco de estudo em muitas pesquisas devido ao alto grau de complexidade para sua resolução. Diversos trabalhos apontam para o uso de metaheurísticas para o tratamento do problema, onde diferentes perspectivas de abordagens têm sido propostas visando encontrar soluções de qualidade em um curto espaço de tempo. Neste trabalho, é proposta uma abordagem baseada na metaheurística Otimização por Colônia de Formigas (Ant Colony Optimization ACO) para o problema de programação reativa da produção em um FMS, com o objetivo de conciliar as características do problema com as características da metaheurística. Para isso, o problema é tratado em duas perspectivas, com base na modelagem e no método de busca. A modelagem do problema é caracterizada por uma descrição do problema em nível de operações, uma vez que a programação da produção está incluída neste contexto. Sobre o modelo é aplicado um método de busca construtiva baseado em ACO que usando o princípio de colaboração, estabelece uma relação entre as operações de forma que esta direcione a busca para regiões promissoras do espaço de soluções. O Objetivo deste trabalho é obter uma programação reativa em tempo de resposta aceitável, visando minimizar o valor de makespan. Resultados experimentais mostraram uma melhoria dos resultados até então obtidos por outras abordagens.
32
Gupta, Avaneesh. "Characterization and measurement of manufacturing flexibility for production planning in high mix low volume manufacturing system /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202004%20GUPTA.
Full text
33
Balogun, Oluwatuminu Omoniya. "The investigation of the effect of scheduling rules on FMS performance." Thesis, Loughborough University, 2000. https://dspace.lboro.ac.uk/2134/36015.
Full textAbstract:
The application of Flexible Manufacturing Systems (FMSs) has an effect in competitiveness, not only of individual companies but of those countries whose manufactured exports play a significant part in their economy (Hartley, 1984). However, the increasing use of FM Ss to effectively provide customers with diversified products has created a significant set of operational challenges for managers (Mahmoodi et al., 1999). In more recent years therefore, there has been a concentration of effort on FMS scheduling without which the benefits of an FMS cannot be realized. The objective of the reported research is to investigate and extend the contribution which can be made to the FMS scheduling problem through the implementation of computer-based experiments that consider real-time situations.
34
Reyes, Moro Antonio. "Scheduling of flexible manufacturing systems integrating Petri nets and artificial intelligence methods." Thesis, Liverpool John Moores University, 2000. http://researchonline.ljmu.ac.uk/5527/.
Full textAbstract:
The work undertaken in this thesis is about the integration of two well-known methodologies: Petri net (PN) model Ii ng/analysis of industrial production processes and Artificial Intelligence (AI) optimisation search techniques. The objective of this integration is to demonstrate its potential in solving a difficult and widely studied problem, the scheduling of Flexible Manufacturing Systems (FIVIS). This work builds on existing results that clearly show the convenience of PNs as a modelling tool for FIVIS. It addresses the problem of the integration of PN and Al based search methods. Whilst this is recognised as a potentially important approach to the scheduling of FIVIS there is a lack of any clear evidence that practical systems might be built. This thesis presents a novel scheduling methodology that takes forward the current state of the art in the area by: Firstly presenting a novel modelling procedure based on a new class of PN (cb-NETS) and a language to define the essential features of basic FIVIS, demonstrating that the inclusion of high level FIVIS constraints is straight forward. Secondly, we demonstrate that PN analysis is useful in reducing search complexity and presents two main results: a novel heuristic function based on PN analysis that is more efficient than existing methods and a novel reachability scheme that avoids futile exploration of candidate schedules. Thirdly a novel scheduling algorithm that overcomes the efficiency drawbacks of previous algorithms is presented. This algorithm satisfactorily overcomes the complexity issue while achieving very promising results in terms of optimality. Finally, this thesis presents a novel hybrid scheduler that demonstrates the convenience of the use of PN as a representation paradigm to support hybridisation between traditional OR methods, Al systematic search and stochastic optimisation algorithms. Initial results show that the approach is promising.
35
Chen, Jie. "Adaptive Scheduling and Tool Flow Control in Automated Manufacturing Systems." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/27159.
Full textAbstract:
The recent manufacturing environment is characterized as having diverse products due to mass customization, short production lead-time, and unstable customer demand. Today, the need for flexibility, quick responsiveness, and robustness to system uncertainties in production scheduling decisions has increased significantly. In traditional job shops, tooling is usually assumed as a fixed resource. However, when tooling resource is shared among different machines, a greater product variety, routing flexibility with a smaller tool inventory can be realized. Such a strategy is usually enabled by an automatic tool changing mechanism and tool delivery system to reduce the time for tooling setup, hence allows parts to be processed in small batches. In this research, a dynamic scheduling problem under flexible tooling resource constraints is studied. An integrated approach is proposed to allow two levels of hierarchical, dynamic decision making for job scheduling and tool flow control in Automated Manufacturing Systems. It decomposes the overall problem into a series of static sub-problems for each scheduling window, handles random disruptions by updating job ready time, completion time, and machine status on a rolling horizon basis, and considers the machine availability explicitly in generating schedules.
Two types of manufacturing system models are used in simulation studies to test the effectiveness of the proposed dynamic scheduling approach. First, hypothetical models are generated using some generic shop flow structures (e.g. flexible flow shops, job shops, and single-stage systems) and configurations. They are tested to provide the empirical evidence about how well the proposed approach performs for the general automated manufacturing systems where parts have alternative routings. Second, a model based on a real industrial flexible manufacturing system was used to test the effectiveness of the proposed approach when machine types, part routing, tooling, and other production parameters closely mimic to the real flexible manufacturing operations. The study results show that the proposed scheduling approach significantly outperforms other dispatching heuristics, including Cost Over Time (COVERT), Apparent Tardiness Cost (ATC), and Bottleneck Dynamics (BD), on due-date related performance measures under both types of manufacturing systems models. It is also found that the performance difference between the proposed scheduling approach and other heuristics tend to become more significant when the number of machines is increased. The more operation steps a system has, the better the proposed method performs, relative to the other heuristics. This research also investigates in what conditions (e.g. the number of machines, the number of operation steps, and shop load conditions) the proposed approach works the best, and how the performance of this proposed approach changes when these conditions change.
When tooling resource is shared, parts can be routed to machines that do not have all the required tools. This may result in higher routing flexibility. However, research work to date in sharing of tooling resources often places more emphasis on the real-time control and manipulation of tools, and pays less attention to the loading of machines and initial tool allocation at the planning stage. In this research, a machine-loading model with shared tools is proposed to maximize routing flexibility while maintaining minimum resident tools. The performance of the proposed loading heuristic is compared to that of a random loading method using hypothetically generated single stage system models. The study result indicates that better system performances can be obtained by taking into account the resident tooling ratio in assigning part types and allocating tools to machines at the initial planning stage.<br>Ph. D.
36
Lee, Siu-lung James. "Hierarchical operational control of automated manufacturing systems /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18812466.
Full text
37
Chen, Yufeng. "Optimal supervisory control of flexible manufacturing systems." Thesis, Paris, CNAM, 2015. http://www.theses.fr/2015CNAM0990/document.
Full textAbstract:
Notre thèse est consacrée à l’étude de la supervision des réseaux de Petri en vue de la conception de systèmes manufacturiers flexibles. L’objectif est la définition de stratégies de pilotage en ligne pour l’évitement de conflits et d’interblocages, dans le cadre de la théorie de la supervision. Le point de départ de notre travail est d’exploiterle graphe de marquage du réseau de Petri, ce qui permet en particulier d’obtenir des stratégies de commande maximalement permissive pour des problèmes d’évitement de conflits et d’interblocages. Nous avons ainsi introduit des techniques originales, manipulations d’inégalités ou réductions d’ensembles de marquages, destinées à diminuerla complexité algorithmique d’une telle méthode. Dans premier temps, nous avons focalisé sur la synthèse de superviseurs dits purs, ce qui correspond au cas particulier où l’ensemble de marquage légaux, est convexe.Cette optimisation est ensuite considérée du point de vue de la facilité de mise en oeuvre. Nous traitons ainsi de la minimisation de la structure du superviseur et de son coût d’implémentation en préservant une structure de supervision qui offre à la fois la permissivité maximale et une complexité de calcul raisonnable en vue d’utilisationsur des installations réelles. Aussi, nous avons cherché à réduire le nombre de places de contrôle nécessaires pour réaliser un superviseur maximalement permissif, pour cela nous avons formule le calcul du nombre minimal de places de contrôle en termes d’un problème de programmation linéaire. Afin d’affaiblir la complexité de ce calcul de superviseur, deux versions de l’algorithme sont proposées. Ce problème de minimisation de la taille dusuperviseur, quoique fondamental, n’est pas abordé aussi directement dans la littérature. Il s’agit là d’une première contribution.Dans u second temps, nous nous sommes intéressés aux réseaux de Petri à boucles (self-loops). Les boucles étant représentées par une variable qui s’ajoute dans la contrainte inégalité définissant l’ensemble de marquages légaux. Après avoir proposé une méthode de réduction du nombre d’inégalités ainsi que du superviseur optimalen se basant sur les approches et résultats précédents, nous avons établi une condition suffisante d’obtention d’un superviseur maximalement permissif permettant de traiter des ensembles de marquages légaux non convexes.Enfin nous proposons une méthode de synthèse de contrôleur pour une nouvelle classe de réseaux de Petri, avec des arcs inhibiteurs correspondant à des contraintes définies par des intervalles. La taille du contrôleur ainsi obtenu et défini en termes d’arcs inhibiteurs à intervalles s’en trouve réduite ainsi que par conséquent sont coût d’implémentation<br>Reachability graph analysis is an important technique for deadlockcontrol, which always suffers from a state explosion problem since it requires togenerate all or a part of reachable markings.Based on this technique, an optimal or suboptimal supervisor with high behavioralpermissiveness can always be achieved. This thesis focuses on designing liveness enforcing Petri net supervisors for FMSs by considering their behavioralpermissiveness, supervisory structure, and computationnal complexity.The following research contributions are made in this thesis.1. The design of a maximally permissive liveness-enforcing supervisor for an FMSis proposed by solving integer linear programming problems (ILPPs).2. Structural complexity is also an important issue for a maximally permissivePetri net supervisor. A deadlock prevention policy for FMSs is proposed, which canobtain a maximally permissive liveness-enforcing Petri net supervisor while thenumber of control places is compressed.3. In order to overcome the computational complexity problem in MCPP and ensurethat the controlled system is maximally permissive with a simple structure, wedevelop an iterative deadlock prevention policy and a modified version.4. We consider the hardware and software costs in the stage of controlimplementation of a deadlock prevention policy, aiming to obtain a maximallypermissive Petri net supervisor with the lowest implementation cost. A supervisorconsists of a set of control places and the arcs connecting control places totransitions. We assign an implementation cost for each control place and controland observation costs for each transition. Based on reachability graph analysis,maximal permissiveness can be achieved by designing place invariants that prohibitall FBMs but no legal markings.5. Self-loops are used to design maximally permissive supervisors. A self-loop ina Petri net cannot be mathematically represented by its incidence matrix. Wepresent a mathematical method to design a maximally permissive Petri netsupervisor that is expressed by a set of control places with self-loops. A controlplace with a self-loop can be represented by a constraint and a selfloopassociated with a transition whose firing may lead to an illegal marking
38
Monze, Mweene James. "Cost and performance analysis of manufacturing systems with object-oriented simulation." Thesis, University of Sussex, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239461.
Full text
39
Weilnau, Gregory P. "A dynamic scheduling monitor for a manufacturing process /." Online version of thesis, 1990. http://hdl.handle.net/1850/10600.
Full text
40
Dunkler, Olaf. "Human aided control of a flexible machining system." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25663.
Full text
41
Macduffie, John Paul. "Beyond mass production--flexible production systems and manufacturing performance in thw world auto industry." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13702.
Full text
42
李小龍 and Siu-lung James Lee. "Hierarchical operational control of automated manufacturing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31237265.
Full text
43
Bajic, Mirko M. "Design of dynamic cellular manufacturing systems." Title page, abstract and contents only, 2001. http://web4.library.adelaide.edu.au/theses/09PH/09phb165.pdf.
Full textAbstract:
Bibliography: leaves 172-184. An analytical approach to the integrated problems of designing the dynamic cellular manufacturing systems layout concurrently with its material flow (handling) requirements, in such a manner that minimises the material handling within the system. The proposed strategy encourages the design of a dynamic layout to identify simultaneously the machine groups, economical machine distribution, and intracell and intercell layouts.
44
Karlsson, Anders. "Developing high performance manufacturing systems." Doctoral thesis, KTH, Production Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3439.
Full textAbstract:
<p>The work detailed in this dissertation relates to thedevelopment of high performance manufacturing systems. Theperformance factor aimed for is especially flexibility, butthere is an intention of making the results adaptable to focuson performance factors of the readers or users choice. Thefocus of the presented research is not only to provide meansfor accomplishing manufacturing that can handle changes butalso to accomplish flexibility in another area. The resultsshould be applicable in many different situations. The researchhas been divided into three parts: the further development of amanufacturing strategy, the development of a base for amanufacturing system design method and the development of amanufacturing control system.</p><p>The developed strategy is called Assembly-InitiatedProduction (AIP). An implementation of the strategy shouldprovide high manufacturing system flexibility but at the sametime contribute to the lowering of inventory levels andlead-times. Different solutions coupled to technicalrequirements found are also discussed.</p><p>The design method research focuses on basic manufacturingsystem properties and the possibility of expressing theseproperties by using simple combinable abstract units calledconcepts. The principle is the same as in physics where realworld phenomena may be expressed by using standard concepts asfor example time and mass. The intended use of the results isin an early manufacturing system design phase. The method isnot directly linked to the AIP strategy, but could be used forimplementing it.</p><p>Production Planning and Control (PPC) is an important partof a manufacturing system. After having reviewed current PPCpractices, a need for a factory floor PPC system workingregardless of factory floor layout, was identified. Based ontheoretical and industrial studies, the suggested solution is acomputerised, decentralised control system, physicallyseparated from the PPC/ERP system. In order to be able to makequick changes in the schedule, to obtain flexibility and toprovide the organisation with a tool for manufacturing controland decision-making, the system works in real time to provideaccurate and valid data.</p>
45
Ramesh, Abishek Smith Jeffrey S. "Bottleneck detection and mitigation in serial production systems." Auburn, Ala., 2006. http://hdl.handle.net/10415/1298.
Full text
46
Wang, Junwen. "QUALITY ANALYSIS IN FLEXIBLE MANUFACTURING SYSTEMS WITH BATCH PRODUCTIONS." UKnowledge, 2010. http://uknowledge.uky.edu/gradschool_diss/51.
Full textAbstract:
To improve product quality and reduce cost, batch production is often implemented in many exible manufacturing systems. However, the current literature does not provide any method to analyze the quality performance in a flexible manufacturing system with batch production.
In this research, we present an analytical method with closed-form formula to evaluate the quality performance in such systems. Based on the model, we discover and investigate monotonic and non-monotonic properties in quality to provide practical guidance for operation management. To improve product quality, we introduce the notions of quality improvability with respect to product sequencing. In addition, we develop the indicators for quality improvability based on the data available on the factory floor rather than complicated calculations. We define the bottleneck sequence and bottleneck transition as the ones that impede quality in the strongest manner, investigate the sensitivity of quality performance with respect to sequences and transitions, and propose quality bottleneck sequence and transition indicators based on the measured data. Finally, we provide a case study at an automotive paint shop to show how this method is applied to improve paint quality.
Moreover, we explore a potential application to reduce energy consumption and atmospheric emissions at automotive paint shops. By selecting appropriate batch and sequence policies, the paint quality can be improved and repaints can be reduced so that less material and energy will be consumed, and less atmospheric emissions will be generated. It is shown that such scheduling and control method can lead to significant energy savings and emission reduction with no extra investment nor changes to existing painting processes.
The successful development of such method would open up a new area in manufacturing systems research and contribute to establish a solid foundation for an integrated study on productivity, quality and exibility. In addition, it will provide production engineers and operation managers a quantitative tool for continuous improvement on product quality in flexible manufacturing environment
47
O'Kane, James Francis. "The use of a dynamic database within a knowledge-based system for analysing reactive scheduling issues in a FMS." Thesis, Staffordshire University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318342.
Full text
48
Yang, Donghai. "Dynamic planning and scheduling in manufacturing systems with machine learning approaches." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B41757968.
Full text
49
Perera, D. T. S. "The production planning problems of flexible manufacturing systems with high tool variety." Thesis, University of Strathclyde, 1988. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=23762.
Full textAbstract:
This research is concerned with certain production planning problems associated with flexible manufacturing systems (FMS) with high tool variety. In this environment of FMS, the tool requirements at workstations exceed the respective tool magazine capacities. During an extensive survey of related literature, it appeared that the problems associated with this type of FMS have been overlooked by the FMS research community. The operational problems of FMS are discussed with special reference to the constraints imposed by tooling. The characteristics of the selected FMS type are clearly defined. This discussion is supplemented with a detailed description of a real FMS which resembles the operations of the selected type of FMS. Having identified certain drawbacks of some existing simulation software, the development of a comprehensive FMS simulator which uses a novel hybrid modelling technique is discussed. The use of a graphical post-processor which can be used to enhance the system logic of the FMS is also described number of parameters associated with the tool management system are identified and the methods are described to evaluate these parameters. The importance of evaluating these parameters in design and operation of an FMS is stressed. The development of a tool post-processor which can assist in identifying the scale of the tooling problem and in evaluating tool management parameters is presented. A variety of tool availability strategies which reduce the tool exchange rates are suggested and evaluated. Finally, the part selection (for immediate processing) problem is solved using a novel technique which takes the advantage of the availability of real time data in FMS.
50
Hamilton, Wade W. "A methodology that integrates the scheduling of job sequencing and AGV dispatching in a FMS." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09042008-063108/.
Full text