A framework for integrating shop floor modeling and scheduling applications: an illustrative case. Abstract
|
|
- Eustace Singleton
- 5 years ago
- Views:
Transcription
1 A framework for integrating shop floor modeling and scheduling applications: an illustrative case Gonzalo Mejía, Ph.D.; Eliécer Gutiérrez, M.E., M.Sc.; Andrés L. Medaglia, Ph.D. Departamento de Ingeniería Industrial Universidad de los Andes Bogotá D.C., Colombia url: Last update: March 3 rd, 2006 Abstract Scheduling in real-world manufacturing systems is difficult due in part to the lack of modeling and optimization tools which can be efficiently adapted to various shop floor environments. We propose a framework for modeling manufacturing systems which uses a flexible modeling engine and a declarative language. The language allows a high level specification of the system and the engine provides services for creating, storing, and querying the system s model. This paper focuses on the interface between the modeling engine and a flexible Petri Net-based scheduler. Our scheduler pulls data directly from the modeling engine and automatically transforms it into a Petri Net representation. Near-optimal schedules are generated by the Petri Net algorithms and loaded back into the engine for further analysis and processing. Keywords: Petri Nets; scheduling; manufacturing systems modeling; declarative languages; optimization 1 Introduction Industrial scheduling is difficult due to the complexities and particularities at each company. A major problem is the lack of accurate representations of the shop floor for Andrés L. Medaglia: corresponding author (amedagli@uniandes.edu.co)
2 which scheduling methods can be applied. For this reason, generic scheduling software has been difficult to develop. There exist many differences between academic and industrial scheduling applications. Pinedo (2002) highlights some of the key limitations of scheduling frameworks present in the academic literature: 1) the number of jobs do not change over time; 2) lack of emphasis on the rescheduling problem; 3) machine environments are often more complicated than job and flow shops; 4) mathematical models do not take into account human preferences (e.g., a customer requirement may pre-determine an specific machine on which an operation must be performed); 5) most models do not consider machine availability caused by shifts, rest periods, shutdowns or other kind of interruptions; 6) theoretical models concentrate in a single objective, but in real-life scheduling there are present several conflicting objectives; and 7) unlike typical job shop frameworks, in industrial applications jobs can follow alternative routings and each operation can be performed in more than one machine. Moreover, in practice optimal solutions are of little or no interest. What the plant personnel requires is a good schedule which can be followed and trusted. To close the gap between industrial and academic scheduling, some researchers have proposed descriptive languages for manufacturing and production systems. Beck, Currie, and Tate (1993) present a domain description language for scheduling applications which is independent of the implementation details and particular scheduling strategies. Bock and Gruninger (2005) describe a Process Specification Language (PSL), which is a neutral representation for manufacturing processes. This project is being sponsored by the National Institute of Standards and Technology (NIST). Commercial vendors such as ILOG have developed tools that integrate 2
3 modeling and scheduling. ILOG s Optimization Decision Management System (ODMS) includes ILOG Scheduler, a tool that offers a C++ object model library for representing finite capacity scheduling and resource allocation problems (ILOG, 2003). Other modeling approaches for manufacturing systems are based on state space representations. These methods provide both a graphical representation and a mathematical formalism which can be used for analysis, validation and verification. One of the most powerful state space based tools are Petri Nets which have been used for modeling a wide variety of manufacturing systems due to their capabilities to represent features such as alternative routing, parallel machines, and assembly operations, among others. More recently Petri Nets have been also used for optimization purposes by using Heuristic Search methods in their state space.. In a companion paper, we fully described an architecture for modeling real world manufacturing systems using a modeling engine and a supporting language. The language allows a high level specification of a manufacturing system and the engine provides services for creating, storing, and querying the manufacturing system s model.. In this paper we illustrate the integration of the modeling framework with scheduling applications. Such a framework pulls instantiated information of a manufacturing system and translates it into a Petri Net model which supports scheduling algorithms. Two Petri Net based scheduling algorithms, described below, perform the scheduling function. The resulting schedules can be loaded back into the engine for further processing. For instance, the final schedule can be displayed and analyzed with the ILOG Scheduler Viewer. This paper is organized as follows. In Section 2 we describe the architecture of the integration framework. Section 3 describes the Petri Net modeling technique and the 3
4 scheduling algorithms which lie at the core of the system. Section 4 describes a particular implementation of the integration framework with the Petri Net scheduler. Last, Section 5 describes briefly some lines of research to be explored in the future. 2 Integration Framework Architecture Figure 1 shows an overview of the proposed modeling-scheduling integration framework for manufacturing systems which is fully described in Gutiérrez et al. (2006). A real-world manufacturing system is modeled using either a high-level modeling language or a graphical modeling tool (GMT). The model consists of entities (called plant elements) which capture the attributes and behavior of the elements of a manufacturing system. These entities include products, machines, manufacturing operations and work orders, among others. When the entities of the real system are described via the language (or the GMT), an interpreter translates them into their corresponding modeling engine objects. This representation of the real system is denoted in this document as the manufacturing system s model. Engine layer Real-world manufacturing system Modeling Language Interpreter Modeling engine Manufacturing System s Model Modeling L Scheduling Optimization Simulation Application layer Figure 1: Integration framework The upper part of Figure 1 corresponds to the Engine layer described above; the lower part of Figure 1 shows the Application layer which is separated from the Engine 4
5 layer. The Application layer is comprised of third-party applications that connect to the manufacturing system s model via the application programming interface (API) of the modeling engine. In this paper we focus on developing a prototype implementation for the scheduling module of the Application layer. 3 Petri Net Modeling Framework A Petri Net model of a manufacturing system serves for validation and analysis purposes and is the basis for the scheduling algorithms to be described below. A Petri Net is a particular kind of directed graph, together with an initial state called the initial marking M 0. The underlying structure of a Petri Net is a directed, weighted, bipartite graph consisting of two kinds of nodes, called places and transitions where arcs are either from a place to a transition or from a transition to a place. In a graphical representation, places are drawn as circles and transitions as bars or boxes. Places represent actions or conditions; transitions represent events. Tokens reside in places and represent the truth of the condition associated with such places; tokens move by effect of transition firings. A transition fires if all its input places have tokens. When a transition fires it removes a token from all its input places and puts one token in all its output places. Definition. Timed Petri Net (TPN): A TPN is a 6-tuple (P, T, I, O, M 0,, τ) where P = set of n places, T = set of m transitions, P T =, I = a set of input arcs (P T), O = a set of output arcs (T P), M 0 = Initial marking, and τ = set of time delays associated with places. This is the definition of Ordinary Petri Nets in which all arcs weights are 1. 5
6 The modeling approach at the TPN layer follows the concepts of S 4 R nets (Systems of Sequential Systems with Shared Resources) (Ezpeleta et al., 1995; Abdallah et al., 2002). In S 4 R nets, a number of concurrent serial processes are modeled with an equal number of strongly connected state machines. Places belonging to such serial processes are denoted as Operational Places and can be timed, if representing the execution of an operation, or untimed if representing a condition such as part in buffer, ready, or in queue. Resource capacity constraints are incorporated to the model via Resource Places. All resource places are untimed. A full TPN model of a manufacturing system consists of a set of serial processes (job routings) connected by resource places. Conflicts arise by the effect of resource selection and routing flexibility. Resource selection occurs when a resource has the choice of selecting multiple jobs or processes, and routing flexibility refers to the possibility of a job operation to be processed by several resources. Figure 2 illustrates a TPN model of a manufacturing system having two workstations and processing two jobs. Workstation 1 has two machines m 11 and m 12 ; workstation 2 has only one machine m 21. Both jobs follow the same route: first any job is processed by workstation 1 and then by workstation 2. Due to customer constraints job 2 must only be processed by machine m 11, which is a newer machine. When a job finishes its processing on a machine, it moves onto the queue of next machine and the machine is released. In the figure highlighted places represent timed operations. A state machine is a Petri Nets in which all transitions have exactly one input and one output place. 6
7 p 1 t 1 p 2 t 2 p 3 t 3 p 4 t 4 p 5 p 11 p 13 p 6 t 5 p 7 t 6 p 8 t 7 p 9 t 8 p 10 t 5 p 7 t 6 p 12 Figure 2: TPN model of a job shop with two jobs and two workstations Table 1. Place Description for Petri Net of figure 1 Place Description for Petri Net of figure 1 p 1 Job 1 ready p 7 Job 2 being processed by machine m 12 p 2 Job 1 being processed by machine m 11 p 8 Operation 1 of Job 2 finished p 3 Operation 1 of Job 1 finished p 9 Job 2 being processed by machine m 21 p 4 Job 1 being processed by machine m 21 p 10 Operation 2 of Job 2 finished p 5 Operation 2 of Job 1 finished p 11 Machine m 11 available p 6 Job 2 ready p 12 Machine m 12 available p 7 Job 2 being processed by machine m 11 p 13 Machine m 21 available The TPN can be reconfigured using the engine layer services: For example, suppose that a new machine is added to a bank of parallel machines process. An Engine service re-builds the shop floor specification and the Petri Net is reconfigured automatically. 3.1 Scheduling Algorithms Graph Search Based Methods The states of a Petri Net can be deployed into a (reachability) graph. Nodes in this reachability graph are the states or markings of the net and arcs are transition firings which represent changes (events) in the state of the net. The initial marking for this 7
8 graph would be a node with the state i.e., all jobs are ready for processing. A valid schedule corresponds to a path in the reachability graph (sequence of transition firings) which lead from the initial marking to a goal or final marking representing the state all jobs are finished As such, an optimization approach may search the net reachability graph aiming to find the minimum cost path from the initial to the final marking. However, as the reachability graph can be huge, even for small nets, performing a full search would not be a practical alternative. In order to reduce the effort required to search the reachability graph, past approaches have used adaptations of the common A* search algorithm. The A* search algorithm for Petri Nets is a branch-and-bound-like algorithm which expands only the most promising nodes of the reachability graph. Seminal papers date back to 1994 (Lee and DiCesare, 1994). Since then, other authors have presented improved versions of the algorithm. For example, Sun et al. (1994) limited the expansion of the net reachability graph by selectively pruning non-promising branches; Xiong and Zhou (1998) implemented the A* search with limited back-tracking capability; Jeng and Chen (1998) used the Petri Net state equations to calculate lower bounds; Reyes-Moro et al. (2002) presented a staged search approach combined with a pruning strategy to reduce the search space; and Mejía and Odrey (2003) combined classical scheduling theory with graph search techniques to reduce the search effort and achieve near-optimal solutions. In this paper we use an implementation of the BAS (Beam A* Search) scheduling algorithm introduced by Mejía and Odrey (2003). Henceforth we call this implementation Petri Net BAS. An advantage of this algorithm is the versatility to adapt to the user requirements: By adjusting the beam or the number of nodes expanded at 8
9 each level of the reachability graph, the algorithm can run at different speeds. Faster speeds (low beam numbers) produce reasonable schedules in seconds even for large problems, while lower speeds aim to improve the schedule quality. The latest versions of the BAS (Mejía, 2004) algorithm handle several objective functions unlike previous approaches aimed only for the makespan criterion Petri Net based Genetic Algorithms Another approach used for scheduling with Petri Nets is a Genetic Algorithm (GA). Caballero and Mejía (2004) developed a GA algorithm which used the structure of a Petri Net to design a chromosome representation. Such a chromosome is a string of integers which define the transition firing sequence. The length of the chromosome corresponds to the total number of transitions to be fired. The decoding is performed by selecting a transition to fire from the set of enabled transition at each marking state. The decoding strategy always generates valid schedules with any crossover or mutation operators. Henceforth we call this implementation Petri Net GA. 4 Testing the Performance of the Petri-Net Schedulers The performance of both Petri-Net schedulers was tested using a set of classical benchmark Job Shop Scheduling Problems (JSSP) and examples of Flexible Job Shop Problems (FJSSP). A job shop consists of a number of jobs which are processed by a set of machines in some predefined order. In general, jobs follow different routes and no recirculation is allowed. In this project we used the Makespan criterion. Examples of JSSP are the (10 jobs and 10 machines) ABZ5 and ABZ6 problems proposed by Adams et al., (1988) and LA16-LA20 were presented by Lawrence (1984). For these problems 9
10 the Petri-Net models consisted of 220 places and 200 transitions. A summary of the results is shown in Table 2. Notice that both algorithms show competitive results in terms of solution quality and CPU times. These tests were executed in a Pentium 4 running at 2.4 GHz with 512MB of RAM. Table 2. Job Shop Scheduling Results with the BAS and the Petri Net algorithms. Problem Optimal C max C max Petri Net BAS Petri Net (GA) CPU CPU (sec) Dev C max (sec) Dev ABZ % ABZ % LA % % LA % % LA % % LA % % LA % % Dev: Deviation from the optimal solution Cmax: Makespan CPU: Computer Time in seconds. A Flexible Job Shop is a variation of the job shop problem in which machines are replaced by workstations. In each workstation there are a varying number of identical parallel machines. A problem of this type is ffs3 proposed by Pinedo (2002) in which Total Tardiness is the optimization criterion. This problem consists of 15 jobs and 3 workstations and each workstation has up to 5 machines. The resulting Petri Net model has 106 places and 120 transitions. The objective function of the solution found by the specialized Shifting Bottleneck algorithm (Pinedo and Singer, 1999) was 163 and took 17 seconds. BAS obtained a solution with the same objective value in less than 7 seconds in the same computer. 5 An Implementation of the Integration Framework We developed an implementation that integrates the Petri-Net scheduler with the 10
11 shop floor modeling engine as described in Section 2. Figure 3 shows the components and their interactions in the application. Real-world manufacturing system Modeling Language Interpreter Modeling engine API Manufacturing System s Model Engine layer Lekin I/O files Engine-Lekin interface module Lekin scheduling system Schedule Viewer module ILOG s Scheduler Viewer Petri Net BAS Scheduler Petri Net GA Scheduler Application layer Figure 3: Implementation of the integration framework The modeling engine provides the language and services required to construct a manufacturing system model. This model includes the specification of the resources and the work orders to be scheduled. As described above, this specification is translated into a Petri Net model. Such a Petri Net model is the framework in which the Petri Net schedulers operate. These schedulers can be linked as plug-in components to third party software packages or to user-interfaces. In this project we used the Lekin scheduling software developed at NYU (Pinedo, 2005; Pinedo & Chao, 1999). The Lekin system allows user-implemented algorithms and supports basic framework configurations ranging from single machine to flexible job shops. Lekin provides a user interface and offers an open specification for input/output file formats used for scheduling problems. More importantly, it allows the integration of user-implemented algorithms. For instance, in our application we integrated into Lekin the Petri Net BAS and Petri Net GA schedulers described in the previous section. Our implementation incorporates an Engine-Lekin interface module which provides 11
12 services for writing and reading the Lekin files. The writing service generates the Lekin input files for the work orders and resources stored in the modeling engine. The reading service loads into the engine the schedules generated by the algorithms invoked from the Lekin system. The externally produced schedule can be analyzed and visualized by other modules integrated to the engine. For example, a Schedule-Viewer module retrieves a schedule from the engine and displays it graphically using a third-party component, namely, the ILOG Scheduler Viewer (ILOG, 2006). This component, included in the ILOG s Optimization Decision Management System (ODMS), displays a Gantt chart for resources and activities, and calculates the resource loads. The ILOG component reads the schedule from an XML file generated by the Schedule Viewer module. To illustrate the integration framework we use a classical benchmark problem, namely the (10 jobs and 10 machines) ABZ5 problem proposed by Adams, Balas, & Zawack (1988). The problem was modeled using the language described in the modeling engine framework (Gutiérrez et al., 2006). Figure 4 shows a fragment of the source file for the problem ABZ5, including definitions for resources, manufacturing operations and process routings. This file was compiled with our own interpreter and the model loaded into the engine. Next, from the model representation, the Engine-Lekin interface module generates the Lekin input files (see Figure 5). 12
13 Figure 4: Model description using the modeling language for problem ABZ5 (a) Job Routing (b) WorkStations (c) Schedule Figure 5: Lekin files for problem ABZ5 The Petri-Net schedulers, plugged into Lekin, were used to solve the problems. Figure 6 shows the final schedule for problem ABZ5 in the Lekin scheduling system. 13
14 This schedule was stored using the Lekin output format shown in Figure 5 (c). Figure 6: Lekin s display of the Petri-Net BAS schedule for problem ABZ5 After a solution was found, it was loaded into the engine using the Engine-Lekin interface again. We use the Schedule-Viewer module to export the schedule into the XML format shown in Figure 7 required by ILOG s Scheduler Viewer. Finally, we retrieve the schedule from the engine by means of the XML to generate the Gantt and load charts shown in Figure 8. 14
15 Figure 7: ILOG Scheduler Viewer XML file Figure 8: Gantt and load charts in ILOG Schedule Viewer for problem ABZ5 15
16 6 Future Research and Concluding Remarks In this paper we presented an integrated modeling and optimization framework intended for real-world scheduling problems. This document presents the integration of the modeling engine, Petri Net models and scheduling algorithms. At this stage, we illustrated the application with a classical job shop problem. Future research will be focused on modeling and scheduling systems which include features such as operations with multiple resources, alternative routings, setup times, production batches, machine setups, customer due dates and order releases. 7 Acknowledgments This research project has been funded by: (1) Colciencias (the Colombian Institute for the Development of Science and Technology) under grant ; (2) Sistemas Corporativos S.A.; and (3) Universidad de los Andes. We also thank José T. Hernández, the former Dean of the Engineering School at Universidad de los Andes, and Oscar Ramos who envisioned the project. Last, but not least, we would like to thank Andrés Marentes, Juan Carlos Martínez, Andrés Molano and Cristina Sarmiento, for their valuable contributions to the project. 8 References Abdallah, I. B., Elmaraghy, H. A., & Elmekkawy, T. Y. (2002). Deadlock-free Scheduling in Flexible Manufacturing Systems using Petri-Nets, International. Journal of Production Research, 40(12), Adams, J., Balas, E., & Zawack, D. (1988) The shifting bottleneck procedure for job shop scheduling, Management Science, 34, Beck H., Currie, K., & Tate, A. (1993). A Domain Description Language for Job-Shop 16
17 Scheduling. Artificial Intelligence Applications Institute, University of Edinburgh. Techinical Report AIAI-TR-137. Bock, C., Gruninger, M. (2005). PSL: A semantic domain for flow models. Software and System Modeling, 4, Caballero, J. P. & Mejía, G. (2004). A Hybrid Approach that combines Petri Net models and Genetic Algorithms for scheduling of Flexible Manufacturing Systems. In Proceedings of the III Congreso Colombiano - I Conferencia Andina de Investigación de Operaciones (CCIO-2004). Ezpeleta, J., Colom, M., & Martínez, J. (1995). A Petri Net Based Deadlock Prevention Policy for Flexible Manufacturing Systems. IEEE Transactions on Robotics and Automation, 11(2), Gutiérrez,.E., Botero, R., Hernández, J., Takahashi, S., & Medaglia, A. L. (2006). An Object Oriented Modeling Engine of Manufacturing Systems. Centro para la Optimización y la Probabilidad Aplicada, Universidad de los Andes. Working Paper. Available at ILOG (2003). ILOG Scheduler 6.0. User Manual. ILOG Inc. ILOG (2006). ILOG Views. ILOG Inc. Last access on February 22, 2006 from Jeng, M. D. & Chen, S. C. (1998). A Heuristic Search Approach Using Approximate Solutions to Petri Net State Equations for Scheduling Flexible Manufacturing Systems. The International Journal of Flexible Manufacturing Systems, 10, Lawrence, S. (1984). Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania. 17
18 Lee, D. Y. & DiCesare, F. (1994). Scheduling Flexible Manufacturing Systems using Petri Nets and Heuristic Search. IEEE Transactions on Robotics and Automation, 10(2), Mejía, G. (2004). A Petri Net Based Algorithm for Minimizing Total Tardiness in Flexible Manufacturing Systems. In Proceedings of the III Congreso Colombiano - I Conferencia Andina de Investigación de Operaciones (CCIO-2004). Mejía, G. & Odrey, N. G. (2003). Petri Net Models and Heuristic Search for Scheduling of Manufacturing Systems: A Comparative Study. In Proceedings of the 17th International Conference on Production Research, Blackburn, VA (USA). Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems. Second Edition, New Jersey: Prentice Hall. Pinedo, M. (2005). Planning and Scheduling in Manufacturing and Services. New York: Springer. Pinedo, M. & Chao, X. (1999). Operations Scheduling with Applications in Manufacturing and Services. New York: Irwin/McGraw-Hill. Pinedo, M. & Singer, M. (1999). A Shifting Bottleneck Heuristic for Minimizing the Total Weighted Tardiness in Job Shops. Naval Research Logistics, 46, Reyes-Moro, A., Yu, H., Kelleher, G. & Lloyd, S. (2002). Integrating Petri Nets and Hybrid Heuristic Search for the Scheduling of FMS. Computers in Industry, 47, Sun, T., Cheng, W. & Fu, L. (1994). A Petri Net Based Approach to Modeling and Scheduling for an FMS and a Case Study. IEEE Transactions on Industrial Electronics, 41(6), Xiong, H. H. & Zhou, M.C. (1998). Scheduling of Semi-Conductor Test Facility via 18
19 Petri Nets and Hybrid Heuristic Search. IEEE Transactions on Semiconductor Manufacturing, 11(3),
A framework for integrating shop floor modeling and scheduling applications: an illustrative case
A framework for integrating shop floor modeling and scheduling applications: an illustrative case Gonzalo Mejía Universidad de los Andes gmejia@uniandes.edu.co Eliécer Gutiérrez Universidad de los Andes
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationA LOCAL SEARCH GENETIC ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM
A LOCAL SEARCH GENETIC ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM Kebabla Mebarek, Mouss Leila Hayat and Mouss Nadia Laboratoire d'automatique et productique, Université Hadj Lakhdar -Batna kebabla@yahoo.fr,
More informationJGA User Guide. WinNT/2000 Deployment v
JGA User Guide WinNT/2000 Deployment v.2005.06.20 Andrés Medaglia (amedagli@uniandes.edu.co) Centro para la Optimización y Probabilidad Aplicada Departamento de Ingeniería Industrial Universidad de los
More informationSystemic Solutions to Deadlock in FMS
Systemic Solutions to Deadlock in FMS Xu gang, Wu zhi Ming Abstract In order to solve deadlock in FMS, an integrated design method for FMS is presented. This method is based on deadlock free scheduling,
More informationPETRI NET BASED SCHEDULING APPROACH COMBINING DISPATCHING RULES AND LOCAL SEARCH
PETRI NET BASED SCHEDULING APPROACH COMBINING DISPATCHING RULES AND LOCAL SEARCH Gašper Mušič (a) (a) University of Ljubljana Faculty of Electrical Engineering Tržaška 25, Ljubljana, Slovenia (a) gasper.music@fe.uni-lj.si
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationSOLVING DEADLOCK STATES IN MODEL OF RAILWAY STATION OPERATION USING COLOURED PETRI NETS
SOLVING DEADLOCK STATES IN MODEL OF RAILWAY STATION OPERATION USING COLOURED PETRI NETS Michal Žarnay University of Žilina, Faculty of Management Science and Informatics, Address: Univerzitná 8215/1, Žilina,
More informationGenetic Algorithm for Job Shop Scheduling
Genetic Algorithm for Job Shop Scheduling Mr.P.P.Bhosale Department Of Computer Science and Engineering, SVERI s College Of Engineering Pandharpur, Solapur University Solapur Mr.Y.R.Kalshetty Department
More informationSIMULATION STUDY OF FLEXIBLE MANUFACTURING CELL BASED ON TOKEN-ORIENTED PETRI NET MODEL
ISSN 1726-4529 Int j simul model 15 (2016) 3, 566-576 Original scientific paper SIMULATION STUDY OF FLEXIBLE MANUFACTURING CELL BASED ON TOKEN-ORIENTED PETRI NET MODEL Nie, X. D. *,** ; Chen, X. D. **
More informationOptimal Manufacturing Scheduling for Dependent Details Processing
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 30 JULY 0 ISSN 1307- Optimal Manufacturing Scheduling for Dependent Details Processing Ivan C. Mustakerov, and Daniela I. Borissova
More informationPetri Nets ~------~ R-ES-O---N-A-N-C-E-I--se-p-te-m--be-r Applications.
Petri Nets 2. Applications Y Narahari Y Narahari is currently an Associate Professor of Computer Science and Automation at the Indian Institute of Science, Bangalore. His research interests are broadly
More informationNew algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Journal of Scientific & Industrial Research ESWARAMURTHY: NEW ALGORITHM FOR ANALYZING PERFORMANCE OF NEIGHBORHOOD STRATEGIES 579 Vol. 67, August 2008, pp. 579-588 New algorithm for analyzing performance
More informationGenetic algorithms for job shop scheduling problems with alternative routings
Downloaded By: [Pusan National University Library] At: 07:0 8 March 008 International Journal of Production Research, Vol., No. 0, May 008, 9 70 Genetic algorithms for job shop scheduling problems with
More informationRepresentations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study
J. Software Engineering & Applications, 2010, 3, 1155-1162 doi:10.4236/jsea.2010.312135 Published Online December 2010 (http://www.scirp.org/journal/jsea) Representations in Genetic Algorithm for the Job
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
More informationRoutePlotter User Guide
RoutePlotter User Guide Win 2000/XP/Vista Deployment v.2007.09.13 Jorge E. Mendoza (jor-mend@uniandes.edu.co) Andrés L. Medaglia (amedagli@uniandes.edu.co) Núbia M. Velasco (nvelasco@uniandes.edu.co) Centro
More informationPriority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem
Bulletin of the JSME Journal of Advanced Mechanical Design, Systems, and Manufacturing Vol.8, No.5, 2014 Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling
More informationPETRI NET ANALYSIS OF BATCH RECIPES
Presented at FOCAPO 98, Snowbird, USA. PETRI NET ANALYSIS OF BATCH RECIPES STRUCTURED WITH GRAFCHART Charlotta Johnsson and Karl-Erik Årzén Department of Automatic Control, Lund Institute of Technology,
More informationMultiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover
Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover J. Garen 1 1. Department of Economics, University of Osnabrück, Katharinenstraße 3,
More informationSOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM
ISSN 1726-4529 Int j simul model 8 (2009) 4, 197-205 Original scientific paper SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH A SIMPLE GENETIC ALGORITHM Lestan, Z.; Brezocnik, M.; Buchmeister, B.; Brezovnik,
More informationLOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING
LOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING Mustafa Muwafak Alobaedy 1, and Ku Ruhana Ku-Mahamud 2 2 Universiti Utara Malaysia), Malaysia,
More informationAn Algorithm to Compute a Basis of Petri Net Invariants
An Algorithm to Compute a Basis of Petri Net Invariants S. Cayir and M. Ucer Electronics and Communication Department, Istanbul Technical University, Istanbul, Turkey cayirs@itu.edu.tr and murvet@ehb.itu.edu.tr
More informationGENETIC LOCAL SEARCH ALGORITHMS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH RELEASE TIME
GENETIC LOCAL SEARCH ALGORITHMS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH RELEASE TIME Jihchang Hsieh^, Peichann Chang^, Shihhsin Chen^ Department of Industrial Management, Vanung University, Chung-Li
More informationSynthesis of An Event Based Supervisor For Deadlock Avoidance In Semiconductor Manufacturing Systems
Synthesis of An Event Based Supervisor For Deadlock Avoidance In Semiconductor Manufacturing Systems Wenle Zhang School of Electrical Engineering and Computer Science Ohio University Athens, Ohio 45701
More informationMANUFACTURING SYSTEM MODELING USING PETRI NETS
International Conference on Economic Engineering and Manufacturing Systems Braşov, 26 27 November 2009 MANUFACTURING SYSTEM MODELING USING PETRI NETS Daniela COMAN, Adela IONESCU, Mihaela FLORESCU University
More informationBI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines
International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol. 2 Issue 4 Dec - 2012 25-32 TJPRC Pvt. Ltd., BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP
More informationEfficient Synthesis of Production Schedules by Optimization of Timed Automata
Efficient Synthesis of Production Schedules by Optimization of Timed Automata Inga Krause Institute of Automatic Control Engineering Technische Universität München inga.krause@mytum.de Joint Advanced Student
More informationTabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach
Tabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach Carlos A. S. Passos (CenPRA) carlos.passos@cenpra.gov.br Daniel M. Aquino (UNICAMP, PIBIC/CNPq)
More informationSeamless design methodology of manufacturing cell-control software based on activity-control-condition and object diagram
Seamless design methodology of manufacturing cell-control software based on activity-control-condition and object diagram TOYOAKI TOMURA, SATOSHI KANAI and TAKESHI KISHINAMI Abstract. A manufacturing cell
More informationA Two-Level Genetic Algorithm for Scheduling in Assembly Islands with Fixed-Position Layouts
A Two-Level Genetic Algorithm for Scheduling in Assembly Islands with Fixed-Position Layouts Wei Qin a,1 and George Q Huang b a Department of Industrial and Manufacturing Systems Engineering, the University
More informationModular Petri Net Processor for Embedded Systems
Modular Petri Net Processor for Embedded Systems Orlando Micolini 1, Emiliano N. Daniele, Luis O. Ventre Laboratorio de Arquitectura de Computadoras (LAC) FCEFyN Universidad Nacional de Córdoba orlando.micolini@unc.edu.ar,
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationA Flexible Branch and Bound Method for the Job Shop Scheduling Problem
IEMS Vol. 8, No. 4, pp. 239-246, December 29. A Flexible Branch and Bound Method for the Job Shop Scheduling Problem Katsumi Morikawa Department of Artificial Complex Systems Engineering, Graduate School
More informationDeadlock Avoidance For Flexible Manufacturing Systems With Choices Based On Digraph Circuit Analysis
Deadlock Avoidance For Flexible Manufacturing Systems With Choices Based On Digraph Circuit Analysis Wenle Zhang and Robert P. Judd School of Electrical Engineering and Computer Science Ohio University
More informationA Dynamic Scheduling Optimization Model (DSOM)
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 w Volume 6 Issue 4 Ver. II ǁ 2018 ǁ PP. 49-60 A Dynamic Scheduling Optimization Model
More informationIMPERATIVE PROGRAMS BEHAVIOR SIMULATION IN TERMS OF COMPOSITIONAL PETRI NETS
IMPERATIVE PROGRAMS BEHAVIOR SIMULATION IN TERMS OF COMPOSITIONAL PETRI NETS Leontyev Denis Vasilevich, Kharitonov Dmitry Ivanovich and Tarasov Georgiy Vitalievich ABSTRACT Institute of Automation and
More informationPetri Nets ee249 Fall 2000
Petri Nets ee249 Fall 2000 Marco Sgroi Most slides borrowed from Luciano Lavagno s lecture ee249 (1998) 1 Models Of Computation for reactive systems Main MOCs: Communicating Finite State Machines Dataflow
More informationThe Maude LTL Model Checker and Its Implementation
The Maude LTL Model Checker and Its Implementation Steven Eker 1,José Meseguer 2, and Ambarish Sridharanarayanan 2 1 Computer Science Laboratory, SRI International Menlo Park, CA 94025 eker@csl.sri.com
More informationPROPOSED METHODOLOGY FOR COMPARING SCHEDULE GENERATION SCHEMES IN CONSTRUCTION RESOURCE SCHEDULING. Jin-Lee Kim
Proceedings of the 009 Winter Simulation Conference M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin and R. G. Ingalls, eds. PROPOSED METHODOLOGY FOR COMPARING SCHEDULE GENERATION SCHEMES IN CONSTRUCTION
More informationAN OBJECT-ORIENTED VISUAL SIMULATION ENVIRONMENT FOR QUEUING NETWORKS
AN OBJECT-ORIENTED VISUAL SIMULATION ENVIRONMENT FOR QUEUING NETWORKS Hussam Soliman Saleh Al-Harbi Abdulkader Al-Fantookh Abdulaziz Al-Mazyad College of Computer and Information Sciences, King Saud University,
More informationA SMIL Editor and Rendering Tool for Multimedia Synchronization and Integration
A SMIL Editor and Rendering Tool for Multimedia Synchronization and Integration Stephen J.H. Yang 1, Norman W.Y. Shao 2, Kevin C.Y. Kuo 3 National Central University 1 National Kaohsiung First University
More informationA Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem
IEMS Vol. 6, No., pp. 9-4, December 007. A Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem Ji Ung Sun School of Industrial & Managment Engineering Hankuk
More informationAPPLICATION OF COLORED PETRI NET IN MODELING OF AN AGRICULTURAL ENTERPRISE INFORMATION MANAGEMENT SYSTEM
APPLICAION OF COLORED PERI NE IN MODELING OF AN AGRICULURAL ENERPRISE INFORMAION MANAGEMEN SYSEM Fangtian Zhang 1, Kaiyi Wang 1,2,*, Jin Sui 1, Chang Liu 1, Zhongqiang Liu 1 1 National Engineering Research
More informationScheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm
Scheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm Binggang Wang, Yunqing Rao, Xinyu Shao, and Mengchang Wang The State Key Laboratory of Digital Manufacturing Equipment and
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationA Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 2 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0025 A Survey of Solving Approaches
More informationOn-line Deadlock Avoidance for Complex Routing Flexible Manufacturing Cells
International Journal of Applied Science and Engineering 2004. 2, 2: 163-176 On-line Deadlock Avoidance for Complex Routing Flexible Manufacturing Cells Tzong-Ming Cheng Department of Industrial Engineering
More informationCharacterising Resource Management Performance in Kubernetes. Appendices.
Characterising Resource Management Performance in Kubernetes. Appendices. Víctor Medel a, Rafael Tolosana-Calasanz a, José Ángel Bañaresa, Unai Arronategui a, Omer Rana b a Aragon Institute of Engineering
More informationSolving Single Machine Scheduling Problem with Maximum Lateness Using a Genetic Algorithm
Solving Single Machine Scheduling Problem with Maximum Lateness Using a Genetic Algorithm Habibeh NAZIF (Corresponding author) Department of Mathematics, Faculty of Science Universiti Putra Malaysia, 43400
More informationTechnical Research on Describing Reconfigurable Systems by Object Oriented Petri net
Technical Research on Describing Reconfigurable Systems by Object Oriented Petri net Jun Guo 1,2 Sheqin Dong 1 Kegang Hao 2 Satoshi Goto 3 1 Dept. of Computer Science of Tsinghua University, Beijin 100084
More informationA GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS
A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS BERNA DENGIZ AND FULYA ALTIPARMAK Department of Industrial Engineering Gazi University, Ankara, TURKEY 06570 ALICE E.
More informationTime Shifting Bottlenecks in Manufacturing
Roser, Christoph, Masaru Nakano, and Minoru Tanaka. Time Shifting Bottlenecks in Manufacturing. In International Conference on Advanced Mechatronics. Asahikawa, Hokkaido, Japan, 2004. Time Shifting Bottlenecks
More informationReload Cost Trees and Network Design
Reload Cost Trees and Network Design Ioannis Gamvros, ILOG, Inc., 1080 Linda Vista Avenue, Mountain View, CA 94043, USA Luis Gouveia, Faculdade de Ciencias da Universidade de Lisboa, Portugal S. Raghavan,
More informationTIMED PETRI NETS FOR SOFTWARE APPLICATIONS
The International Workshop on Discrete-Event System Design, DESDes 01, June 27 29, 2001; Przytok near Zielona Gora, Poland TIMED PETRI NETS FOR SOFTWARE APPLICATIONS Grzegorz ANDRZEJEWSKI Computer Engineering
More informationSolving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller
Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller Yasuhiro Tsujimura *, Mitsuo Gen ** and Admi Syarif **,*** * Department
More informationFrom Task Graphs to Petri Nets
From Task Graphs to Petri Nets Anthony Spiteri Staines Department of Computer Inf. Systems, Faculty of ICT, University of Malta Abstract This paper describes the similarities between task graphs and Petri
More informationMiguel A. Mujica* and Miquel Angel Piera
Int. J. Simulation and Process Modelling, Vol. 6, No. 2, 2010 165 Performance optimisation of a CNC machine through exploration of timed state space Miguel A. Mujica* and Miquel Angel Piera Department
More informationPetri Nets: Properties, Applications, and Variations. Matthew O'Brien University of Pittsburgh
Petri Nets: Properties, Applications, and Variations Matthew O'Brien University of Pittsburgh Introduction A Petri Net is a graphical and mathematical modeling tool used to describe and study information
More informationComposability Test of BOM based models using Petri Nets
I. Mahmood, R. Ayani, V. Vlassov and F. Moradi 7 Composability Test of BOM based models using Petri Nets Imran Mahmood 1, Rassul Ayani 1, Vladimir Vlassov 1, and Farshad Moradi 2 1 Royal Institute of Technology
More informationA Frame Study for Post-Processing Analysis on System Behavior: A Case Study of Deadline Miss Detection
Journal of Computer Science 6 (12): 1505-1510, 2010 ISSN 1549-3636 2010 Science Publications A Frame Study for Post-Processing Analysis on System Behavior: A Case Study of Deadline Miss Detection Junghee
More informationA Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem
2011, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com A Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem Mohammad
More informationWEEK 5 - APPLICATION OF PETRI NETS. 4.4 Producers-consumers problem with priority
4.4 Producers-consumers problem with priority The net shown in Fig. 27 represents a producers-consumers system with priority, i.e., consumer A has priority over consumer B in the sense that A can consume
More informationPetri Nets. Robert A. McGuigan, Department of Mathematics, Westfield State
24 Petri Nets Author: College. Robert A. McGuigan, Department of Mathematics, Westfield State Prerequisites: The prerequisites for this chapter are graphs and digraphs. See Sections 9.1, 9.2, and 10.1
More informationOptimization of a Multiproduct CONWIP-based Manufacturing System using Artificial Bee Colony Approach
Optimization of a Multiproduct CONWIP-based Manufacturing System using Artificial Bee Colony Approach Saeede Ajorlou, Member, IAENG, Issac Shams, Member, IAENG, and Mirbahador G. Aryanezhad Abstract In
More informationINFORMS Annual Meeting 2013 Eva Selene Hernández Gress Autonomous University of Hidalgo
INFORMS Annual Meeting 2013 Eva Selene Hernández Gress Autonomous University of Hidalgo In this paper we proposed a solution to the JobShop Scheduling Problem using the Traveling Salesman Problem solved
More informationA Tool for Comparing Resource-Constrained Project Scheduling Problem Algorithms
A Tool for Comparing Resource-Constrained Project Scheduling Problem Algorithms Alexandru-Liviu Olteanu Computer Science and Automated Control Faculty of Engineering, Lucian Blaga University of Sibiu Str.
More informationEE249 Discussion Petri Nets: Properties, Analysis and Applications - T. Murata. Chang-Ching Wu 10/9/2007
EE249 Discussion Petri Nets: Properties, Analysis and Applications - T. Murata Chang-Ching Wu 10/9/2007 What are Petri Nets A graphical & modeling tool. Describe systems that are concurrent, asynchronous,
More informationVirtual Plant for Control Program Verification
2011 International Conference on Circuits, System and Simulation IPCSIT vol.7 (2011) (2011) IACSIT Press, Singapore Virtual Plant for Control Program Verification Sangchul Park 1 + and June S. Jang 2 1
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationParallel Combinatorial Search on Computer Cluster: Sam Loyd s Puzzle
Parallel Combinatorial Search on Computer Cluster: Sam Loyd s Puzzle Plamenka Borovska Abstract: The paper investigates the efficiency of parallel branch-and-bound search on multicomputer cluster for the
More informationA Context Inference Framework based on Fuzzy Colored Timed Petri Nets
Proceeding of the 9th WSEAS Int. Conference on Data Networks, Communications, Computers, Trinidad and Tobago, November 5-7, 2007 458 A Context Inference Framework based on Fuzzy Colored Timed Petri Nets
More informationPREDICTING CLUSTER TOOL BEHAVIOR WITH SLOW DOWN FACTORS. Robert Unbehaun Oliver Rose
Proceedings of the 27 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. PREDICTING CLUSTER TOOL BEHAVIOR WITH SLOW DOWN FACTORS Robert
More informationKey words. graph algorithms, chromatic number, circular arc graphs, induced cycles
SIAM J. COMPUT. Vol. 0, No. 0, pp. 000 000 c XXXX Society for Industrial and Applied Mathematics REVISITING TUCKER S ALGORITHM TO COLOR CIRCULAR ARC GRAPHS MARIO VALENCIA-PABON Abstract. The circular arc
More informationHYBRID PETRI NET MODEL BASED DECISION SUPPORT SYSTEM. Janetta Culita, Simona Caramihai, Calin Munteanu
HYBRID PETRI NET MODEL BASED DECISION SUPPORT SYSTEM Janetta Culita, Simona Caramihai, Calin Munteanu Politehnica University of Bucharest Dept. of Automatic Control and Computer Science E-mail: jculita@yahoo.com,
More informationA Case Study on Earliness/Tardiness Scheduling by Constraint Programming
A Case Study on Earliness/Tardiness Scheduling by Constraint Programming Jan Kelbel, Zdeněk Hanzálek Department of Control Engineering, Faculty of Electrical Engineering Czech Technical University in Prague
More informationModeling, Scheduling, and Prediction in Wafer Fabrication Systems Using Queueing Petri Net and Genetic Algorithm
Modeling, Scheduling, and Prediction in Wafer Fabrication Systems Using Queueing Petri Net and Genetic Algorithm Hung-Wen, Li-Chen Fu, and Shih-Shinh Huang Department of Computer Science and Information
More informationSimulation of Petri Nets in Rule-Based Expert System Shell McESE
Abstract Simulation of Petri Nets in Rule-Based Expert System Shell McESE F. Franek and I. Bruha Dept of Computer Science and Systems, McMaster University Hamilton, Ont., Canada, L8S4K1 Email: {franya
More informationA UML SIMULATOR BASED ON A GENERIC MODEL EXECUTION ENGINE
A UML SIMULATOR BASED ON A GENERIC MODEL EXECUTION ENGINE Andrei Kirshin, Dany Moshkovich, Alan Hartman IBM Haifa Research Lab Mount Carmel, Haifa 31905, Israel E-mail: {kirshin, mdany, hartman}@il.ibm.com
More informationOptimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm N. Shahsavari Pour Department of Industrial Engineering, Science and Research Branch, Islamic Azad University,
More informationA counter-example to the minimal coverability tree algorithm
A counter-example to the minimal coverability tree algorithm A. Finkel, G. Geeraerts, J.-F. Raskin and L. Van Begin Abstract In [1], an algorithm to compute a minimal coverability tree for Petri nets has
More informationOn Petri Nets and Predicate-Transition Nets
On Petri Nets and Predicate-Transition Nets Andrea Röck INRIA - project CODES Roquencourt - BP 105 Le Chesnay Cedex 78153, FRANCE Ray Kresman Department of Computer Science Bowling Green State University
More informationFormal Support for QVT-Relations with Coloured Petri Nets
Formal Support for QVT-Relations with Coloured Petri Nets Juan de Lara Univ. Autónoma de Madrid (Spain) MODELS 2009 Denver, Colorado, USA Esther Guerra 1 Univ. Carlos III de Madrid (Spain) Motivation Model-to-Model
More informationOutline. Petri nets. Introduction Examples Properties Analysis techniques. 1 EE249Fall04
Outline Petri nets Introduction Examples Properties Analysis techniques 1 Petri Nets (PNs) Model introduced by C.A. Petri in 1962 Ph.D. Thesis: Communication with Automata Applications: distributed computing,
More informationSize-reduction methods for the unrelated parallel machines problem and makespan criterion
4 th International Conference on Industrial Engineering and Industrial Management XIV Congreso de Ingeniería de Organización Donostia- San Sebastián, September 8 th -10 th 2010 Size-reduction methods for
More informationFlowshop Scheduling Problem Introduction
Flowshop Scheduling Problem Introduction The challenge has as focus the PERMUTATION FLOWSHOP PROBLEM, in the MONO OBJECTIVE case, the objective function to be minimized being the overall completion time
More informationWeb page recommendation using a stochastic process model
Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,
More informationA Fast Method for Extracting all Minimal Siphons from Maximal Unmarked Siphons of a Petri Net
582 JOURNAL OF SOFTWARE, VOL. 9, NO. 3, MARCH 2014 A Fast Method for Extracting all Minimal Siphons from Maximal Unmarked Siphons of a Petri Net Qiaoli Zhuang School of Information Science and Technology,
More informationA Fast Approximated k Median Algorithm
A Fast Approximated k Median Algorithm Eva Gómez Ballester, Luisa Micó, Jose Oncina Universidad de Alicante, Departamento de Lenguajes y Sistemas Informáticos {eva, mico,oncina}@dlsi.ua.es Abstract. The
More informationHeuristics for Scheduling Reentrant Flexible Job Shops with Sequence-dependent Setup Times and Limited Buffer Capacities
Clemson University TigerPrints All Dissertations Dissertations 8-2007 Heuristics for Scheduling Reentrant Flexible Job Shops with Sequence-dependent Setup Times and Limited Buffer Capacities Jakrawarn
More informationSchedule Optimization based on Coloured Petri Nets and Local Search
Schedule Optimization based on Coloured Petri Nets and Local Search Gašper Mušič University of Ljubljana, Faculty of Electrical Engineering, Tržaška 25, 1000 Ljubljana, Slovenia (e-mail: gasper.music@fe.uni-lj.si).
More informationGenetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
More informationUtilizing Static Analysis for Programmable Logic Controllers
Sébastien Bornot Ralf Huuck Ben Lukoschus Lehrstuhl für Softwaretechnologie Universität Kiel Preußerstraße 1 9, D-24105 Kiel, Germany seb rhu bls @informatik.uni-kiel.de Yassine Lakhnech Verimag Centre
More informationStructure of Abstract Syntax trees for Colored Nets in PNML
Structure of Abstract Syntax trees for Colored Nets in PNML F. Kordon & L. Petrucci Fabrice.Kordon@lip6.fr Laure.Petrucci@lipn.univ-paris13.fr version 0.2 (draft) June 26, 2004 Abstract Formalising the
More informationSENSITIVITY ANALYSIS OF CRITICAL PATH AND ITS VISUALIZATION IN JOB SHOP SCHEDULING
SENSITIVITY ANALYSIS OF CRITICAL PATH AND ITS VISUALIZATION IN JOB SHOP SCHEDULING Ryosuke Tsutsumi and Yasutaka Fujimoto Department of Electrical and Computer Engineering, Yokohama National University,
More informationIncremental temporal reasoning in job shop scheduling repair
Incremental temporal reasoning in job shop scheduling repair The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published
More informationA Brief Introduction to Coloured Petri Nets
A Brief Introduction to Coloured Petri Nets Kurt Jensen Computer Science Department, University of Aarhus NyMunkegade, Bldg. 540, DK-8000 AarhusC, Denmark E-mml: kjensen9 WWV~: http://www.daimi.aau.dk/~kjensen/
More informationflow shop scheduling with multiple operations and time lags
flow shop scheduling with multiple operations and time lags J. Riezebos and G.J.C. Gaalman Faculty of Management and Organization, University of Groningen J.N.D. Gupta Department of Management, Ball State
More informationModelling of a Sequential Low-level Language Program Using Petri Nets
Innovative Systems Design and Engineering ISSN 2222-1727 (Paper) ISSN 2222-2871 (Online) Vol 2, No 5, 2011 www.iiste.org Modelling of a Sequential Low-level Language Program Using Petri Nets Ganiyu Rafiu
More informationKRON: An Approach for the Integration of Petri Nets in Object Oriented Models of Discrete Event Systems
KRON: An Approach for the Integration of Petri Nets in Object Oriented Models of Discrete Event Systems J.L. Villarroel, J.A. Bañares and P.R. Muro-Medrano Departamento de Ingeniería Eléctrica e Informatica
More information