{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T14:08:14Z","timestamp":1777385294497,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,3,12]],"date-time":"2009-03-12T00:00:00Z","timestamp":1236816000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10626-009-0064-9","type":"journal-article","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T10:22:50Z","timestamp":1236766970000},"page":"287-315","source":"Crossref","is-referenced-by-count":22,"title":["Time-Optimal Coordination of Flexible Manufacturing Systems Using Deterministic Finite Automata and Mixed Integer Linear Programming"],"prefix":"10.1007","volume":"19","author":[{"given":"Avenir","family":"Kobetski","sequence":"first","affiliation":[]},{"given":"Martin","family":"Fabian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,12]]},"reference":[{"issue":"3","key":"64_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391\u2013401","journal-title":"Manage Sci"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"\u00c5kesson K, Fabian M, Flordal H, Malik R (2006) Supremica\u2014an integrated environment for verification, synthesis and simulation of discrete event systems. In: Proc. of the 8th workshop on discrete event systems (WODES\u201906), Ann Arbor","DOI":"10.1109\/WODES.2006.382401"},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/CDC.2003.1272423"},{"key":"64_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J Blazewicz","year":"1996","unstructured":"Blazewicz J, Domschke W, Pesch E (1996) The job shop scheduling problem: conventional and new solution techniques. Eur J Oper Res 93:1\u201333","journal-title":"Eur J Oper Res"},{"key":"64_CR5","unstructured":"COIN-OR Branch and Cut (2008) Cbc homepage. http:\/\/projects.coin-or.org\/Cbc"},{"key":"64_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry","author":"M Berg de","year":"2000","unstructured":"de\u00a0Berg M, van Kreveld M, Overmars M, Schwarzkopf O (2000) Computational geometry, 2nd edn. Springer, Berlin Heidelberg New York","edition":"2"},{"key":"64_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/TASE.2007.909632","volume":"5","author":"P Falkman","year":"2008","unstructured":"Falkman P, Nielsen J, Lennartson B, von Euler-Chelpin A (2008) Generation of step ap214 models from discrete event systems for process planning and control. IEEE Trans Autom Sci Eng 5:113\u2013126","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"64_CR8","volume-title":"Chapter probabilistic learning combinations of local job-shop scheduling rules","author":"H Fisher","year":"1963","unstructured":"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"},{"issue":"4","key":"64_CR9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10626-007-0018-z","volume":"17","author":"H Flordal","year":"2007","unstructured":"Flordal H, Malik R, Fabian M, \u00c5kesson K (2007) Compositional synthesis of maximally permissive supervisors using supervision equivalence. Discret Event Dyn Syst 17(4):475\u2013504","journal-title":"Discret Event Dyn Syst"},{"key":"64_CR10","unstructured":"GNU Linear Programming Kit (2008) GNU Linear Programming Kit homepage. http:\/\/www.gnu.org\/software\/glpk"},{"key":"64_CR11","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR (1985) Communicating sequential processes. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs"},{"key":"64_CR12","unstructured":"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"},{"key":"64_CR13","unstructured":"ILOG CPLEX (2008) ILOG homepage. http:\/\/www.ilog.com"},{"key":"64_CR14","unstructured":"ISO 10303-1 (1994) Industrial automation systems and integration\u2014product data representation and exchange\u2014part 1: overview and fundamental principles. ISO standard"},{"key":"64_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson DB (1975) Finding all the elementary circuits of a directed graph. SIAM J Comput 4:77\u201384","journal-title":"SIAM J Comput"},{"key":"64_CR16","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/WODES.2006.1678411"},{"key":"64_CR17","unstructured":"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"},{"key":"64_CR18","doi-asserted-by":"crossref","unstructured":"Kobetski A, Richardsson J, \u00c5kesson 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","DOI":"10.1109\/COASE.2007.4341802"},{"key":"64_CR19","doi-asserted-by":"crossref","unstructured":"Kobetski A, Spensieri D, Fabian M (2006) Scheduling algorithms for optimal robot cell coordination\u2014a comparison. In: Proc. of the IEEE conference on automation science and engineering, Shanghai","DOI":"10.1109\/COASE.2006.326912"},{"key":"64_CR20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/70.768182","volume":"15","author":"MA Lawley","year":"1999","unstructured":"Lawley MA (1999) Deadlock avoidance for production systems with flexible routing. Trans Robot Autom 15:497\u2013509","journal-title":"Trans Robot Autom"},{"key":"64_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/70.282537","volume":"10","author":"DY Lee","year":"1994","unstructured":"Lee DY, DiCesare F (1994) Scheduling flexible manufacturing systems using petri nets and heuristic search. IEEE Trans Robot Autom 10:123\u2013132","journal-title":"IEEE Trans Robot Autom"},{"issue":"3","key":"64_CR22","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/9.280750","volume":"39","author":"Y Li","year":"1994","unstructured":"Li Y, Wonham WM (1994) Control of vector discrete-event systems II\u2014controller synthesis. Trans Automat Contr 39(3):512\u2013531","journal-title":"Trans Automat Contr"},{"key":"64_CR23","unstructured":"Liljenvall T (1998) Scheduling for production systems. Lic.\u00a0Thesis 293L, School of Electrical and Computer Engineering, Chalmers University of Technology"},{"key":"64_CR24","series-title":"CRC Press Operations Research Series","first-page":"253","volume-title":"Integer programming: theory and practice","author":"JT Linderoth","year":"2005","unstructured":"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\u2013303"},{"key":"64_CR25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(96)00055-0","volume":"100","author":"J Liu","year":"1997","unstructured":"Liu J, MacCarthy BL (1997) A global milp model for fms scheduling. Eur J Oper Res 100:441\u2013453","journal-title":"Eur J Oper Res"},{"key":"64_CR26","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.compchemeng.2003.09.008","volume":"28","author":"CA Mendez","year":"2004","unstructured":"Mendez CA, Cerda J (2004) An milp framework for batch reactive scheduling with limited discrete resources. Comput Chem Eng 28:1059\u20131068","journal-title":"Comput Chem Eng"},{"key":"64_CR27","doi-asserted-by":"crossref","unstructured":"Ni\u00f1o-Mora J (2001) Stochastic scheduling. In: Floudas CA, Pardalos PM (eds) Kluwer, Dordrecht, pp 367\u2013372","DOI":"10.1007\/0-306-48332-7_507"},{"issue":"6","key":"64_CR28","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"key":"64_CR29","first-page":"2751","volume-title":"IEEE international conference on robotics and automation","author":"J Peng","year":"2005","unstructured":"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\u20132758"},{"key":"64_CR30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P Ramadge","year":"1989","unstructured":"Ramadge P, Wonham W (1989) The control of discrete event systems. Proc IEEE 77:81\u201398","journal-title":"Proc IEEE"},{"key":"64_CR31","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","DOI":"10.1007\/b101880","volume-title":"Genetic algorithms\u2014principles and perspectives: a guide to GA theory","author":"CR Reeves","year":"2002","unstructured":"Reeves CR, Rowe JE (2002) Genetic algorithms\u2014principles and perspectives: a guide to GA theory. Operations Research\/Computer Science Interfaces Series. Springer, Berlin Heidelberg New York"},{"key":"64_CR32","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/9.633824","volume":"42","author":"S Reveliotis","year":"1997","unstructured":"Reveliotis S, Lawley M, Ferreira P (1997) Polynomial complexity deadlock avoidance policies for sequential resource allocation systems. IEEE Trans Automat Contr 42:1344\u20131357","journal-title":"IEEE Trans Automat Contr"},{"key":"64_CR33","volume-title":"Artificial intelligence\u2014a modern approach","author":"S Russell","year":"1995","unstructured":"Russell S, Norvig P (1995) Artificial intelligence\u2014a modern approach. Prentice Hall International Editions. Prentice Hall, Englewood Cliffs"},{"key":"64_CR34","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.23919\/ECC.2001.7076321"},{"key":"64_CR35","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, Chichester"},{"key":"64_CR36","unstructured":"Segala R (1995) Modeling and verification of randomized distributed real-time systems. PhD thesis, Massachusetts Institute of Technology"},{"key":"64_CR37","volume-title":"Operating systems concepts","author":"A Silberschatz","year":"1991","unstructured":"Silberschatz A, Peterson G (1991) Operating systems concepts. Addison-Wesley, Reading"},{"key":"64_CR38","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1:146\u2013160","journal-title":"SIAM J Comput"},{"key":"64_CR39","volume-title":"Model building in mathematical programming","author":"HP Williams","year":"1990","unstructured":"Williams HP (1990) Model building in mathematical programming. Wiley, New York"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-009-0064-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-009-0064-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-009-0064-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:52Z","timestamp":1559231932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-009-0064-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,12]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s10626-009-0064-9","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,12]]}}}