A min-max problem for the computation of the cycle time lower bound in interval-based time petri nets

被引：0
|
作者：
机构：
[1] Bernardi, Simona
[2] Campos, Javier
来源：
| 2013年 / Institute of Electrical and Electronics Engineers Inc., United States卷 / 43期
关键词：
35;
D O I：
10.1109/TSMC.2012.2226442
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 35 条
  • [31] Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage
    Zou, Wenjie
    Guo, Longkun
    Huang, Peihuang
    Lin, Geng
    Mei, Hengquan
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (02):
  • [32] Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem
    Marshall, Luke
    Boland, Natashia
    Savelsbergh, Martin
    Hewitt, Mike
    TRANSPORTATION SCIENCE, 2021, 55 (01) : 29 - 51
  • [33] Production cycle-time analysis based on sensor-based stage Petri nets for automated manufacturing systems
    Peng, SS
    Zhou, MC
    2003 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, PROCEEDINGS, 2003, : 4300 - 4305
  • [34] State Space Search for Safe Time Petri Nets Based on Binary Decision Diagrams Tools: Application to Air Traffic Flow Management Problem
    Kammoun, Mohamed Ali
    Rezg, Nidhal
    Achour, Zied
    Rezig, Sadok
    STUDIES IN INFORMATICS AND CONTROL, 2016, 25 (01): : 39 - 50
  • [35] Flow capturing location-allocation problem with piecewise linear value-time function based on max-min ant colony optimization
    Jun, Yang
    Min, Zhang
    2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 1172 - 1175
1234