Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming

Discrete Event Dynamic Systems: Theory and Applications

Volumn 19, Issue 3, 2009, Pages 287-315

  Kobetski, Avenir ^a   Fabian, Martin ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Collision avoidance; Deadlock avoidance; Discrete event systems; Mixed integer linear programming; Scheduling

Indexed keywords

AUTOMATIC CONVERSION; CYCLE TIME; DEADLOCK AVOIDANCE; DETERMINISTIC FINITE AUTOMATA; DISCRETE EVENT SYSTEMS; MANUFACTURING CELLS; MIXED INTEGER LINEAR PROGRAMMING; NON-BLOCKING; PRODUCTION INDUSTRIES; PRODUCTION SYSTEM; SEARCH REGION; SUPERVISORY CONTROL THEORY; TIME-OPTIMAL;

CELL MEMBRANES; COLLISION AVOIDANCE; COMPUTER AIDED INSTRUCTION; CONTROL THEORY; DISCRETE EVENT SIMULATION; DYNAMIC PROGRAMMING; FINITE AUTOMATA; FLEXIBLE MANUFACTURING SYSTEMS; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; SCHEDULING; TRANSLATION (LANGUAGES);

INTEGER PROGRAMMING;

EID: 67650823107     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-009-0064-9     Document Type: Article

References (39)

1. J Adams E Balas D Zawack 1988 The shifting bottleneck procedure for job shop scheduling Manage Sci 34 3 391 401
2. Åkesson K, Fabian M, Flordal H, Malik R (2006) Supremica-an integrated environment for verification, synthesis and simulation of discrete event systems. In: Proc. of the 8th workshop on discrete event systems (WODES'06), Ann Arbor
3. Bayen AM, Tomlin CJ, Yinyu Y, Zhang J (2003) Milp formulation and polynomial time algorithm for an aircraft scheduling problem. In: 42nd IEEE international conference on decision and control, Maui
4. J Blazewicz W Domschke E Pesch 1996 The job shop scheduling problem: conventional and new solution techniques Eur J Oper Res 93 1 33 (Pubitemid 126389264)
5. COIN-OR Branch and Cut (2008) Cbc homepage. http://projects.coin-or.org/ Cbc
6. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry, 2nd edn. Springer, Berlin Heidelberg New York
7. P Falkman J Nielsen B Lennartson A von Euler-Chelpin 2008 Generation of step ap214 models from discrete event systems for process planning and control IEEE Trans Autom Sci Eng 5 113 126
8. Fisher H, Thompson G (1963) Industrial scheduling. In: Muth JF, Thompson GL (eds) Chapter probabilistic learning combinations of local job-shop scheduling rules. Prentice Hall, Englewood Cliffs
9. H Flordal R Malik M Fabian K Åkesson 2007 Compositional synthesis of maximally permissive supervisors using supervision equivalence Discret Event Dyn Syst 17 4 475 504 (Pubitemid 350074187)
10. GNU Linear Programming Kit (2008) GNU Linear Programming Kit homepage. http://www.gnu.org/software/glpk
11. Hoare CAR (1985) Communicating sequential processes. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs
12. Huang Z, Wu Z (2004) Deadlock-free scheduling for automated manufacturing systems using genetic algorithm and petri nets. In: IEEE international conference on robotics and automation, New Orleans
13. ILOG CPLEX (2008) ILOG homepage. http://www.ilog.com
14. ISO 10303-1 (1994) Industrial automation systems and integration-product data representation and exchange-part 1: overview and fundamental principles. ISO standard
15. DB Johnson 1975 Finding all the elementary circuits of a directed graph SIAM J Comput 4 77 84
16. Kobetski A, Fabian M (2006) Scheduling of discrete event systems using mixed integer linear programming. In: Proc. of the 8th IEEE international workshop on discrete event systems. Ann Arbor
17. Kobetski A, Flordal H, Lennartson B, Fabian M (2009) A framework for automatic generation of interlocking functions for flexible manufacturing. Technical Report, Department of Signals and Systems, Chalmers University of Technology, ISSN 1403-266x; nr R004/2009
18. Kobetski A, Richardsson J, Åkesson K, Fabian M (2007) Minimization of expected cycle time in manufacturing cells with uncontrollable behavior. In: Proc. of the IEEE conference on automation science and engineering, Scottsdale
19. Kobetski A, Spensieri D, Fabian M (2006) Scheduling algorithms for optimal robot cell coordination-a comparison. In: Proc. of the IEEE conference on automation science and engineering, Shanghai
20. MA Lawley 1999 Deadlock avoidance for production systems with flexible routing Trans Robot Autom 15 497 509
21. DY Lee F DiCesare 1994 Scheduling flexible manufacturing systems using petri nets and heuristic search IEEE Trans Robot Autom 10 123 132
22. Y Li WM Wonham 1994 Control of vector discrete-event systems II-controller synthesis Trans Automat Contr 39 3 512 531
23. Liljenvall T (1998) Scheduling for production systems. Lic. Thesis 293L, School of Electrical and Computer Engineering, Chalmers University of Technology
24. Linderoth JT, Ralphs TK (2005) Noncommercial software for mixed-integer linear programming. In: Karlof J (ed) Integer programming: theory and practice. CRC Press Operations Research Series. CRC, Boca Raton, pp 253-303
25. J Liu BL MacCarthy 1997 A global milp model for fms scheduling Eur J Oper Res 100 441 453 (Pubitemid 127392368)
26. CA Mendez J Cerda 2004 An milp framework for batch reactive scheduling with limited discrete resources Comput Chem Eng 28 1059 1068 (Pubitemid 38520959)
27. Niño-Mora J (2001) Stochastic scheduling. In: Floudas CA, Pardalos PM (eds) Kluwer, Dordrecht, pp 367-372
28. E Nowicki C Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manage Sci 42 6 797 813 (Pubitemid 126577322)
29. Peng J, Akella S (2005) Coordinating multiple double integrator robots on a roadmap: convexity and global optimality. In: IEEE international conference on robotics and automation. IEEE, Barcelona, pp 2751-2758 (Pubitemid 46084205)
30. P Ramadge W Wonham 1989 The control of discrete event systems Proc IEEE 77 81 98
31. Reeves CR, Rowe JE (2002) Genetic algorithms-principles and perspectives: a guide to GA theory. Operations Research/Computer Science Interfaces Series. Springer, Berlin Heidelberg New York
32. S Reveliotis M Lawley P Ferreira 1997 Polynomial complexity deadlock avoidance policies for sequential resource allocation systems IEEE Trans Automat Contr 42 1344 1357 (Pubitemid 127761236)
33. Russell S, Norvig P (1995) Artificial intelligence-a modern approach. Prentice Hall International Editions. Prentice Hall, Englewood Cliffs
34. Schouwenaars T, DeMoor B, Feron E, How J (2001) Mixed integer programming for safe multi-vehicle cooperative path planning. In: The 2001 European control conference, Porto
35. Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester
36. Segala R (1995) Modeling and verification of randomized distributed real-time systems. PhD thesis, Massachusetts Institute of Technology
37. Silberschatz A, Peterson G (1991) Operating systems concepts. Addison-Wesley, Reading
38. R Tarjan 1972 Depth-first search and linear graph algorithms SIAM J Comput 1 146 160
39. Williams HP (1990) Model building in mathematical programming. Wiley, New York