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 条

[21] Age semantics based State Space Computation of Time Petri Nets.
Abdelli, Abdelkrim
2014 IEEE 15TH INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION (IRI), 2014, : 361 - 368
[22] On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Yunpeng Pan
Leyuan Shi
Mathematical Programming, 2007, 110 : 543 - 559
[23] On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Pan, Yunpeng
Shi, Leyuan
MATHEMATICAL PROGRAMMING, 2007, 110 (03) : 543 - 559
[24] Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time
Wang, Shijin
Cui, Wenli
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (15) : 4579 - 4592
[25] The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
Wang, Xingyin
Golden, Bruce
Wasil, Edward
Zhang, Rui
COMPUTERS & OPERATIONS RESEARCH, 2016, 71 : 110 - 126
[26] Min-Max Regret Version of the Linear Time-Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs
Choi, Byung-Cheon
Park, Myoung-Ju
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (05)
[27] Combined algorithm for time-varying systems based on the robust min-max and the damped least squares estimation
Xue, YC
Yang, QW
Qian, JX
IECON'03: THE 29TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1 - 3, PROCEEDINGS, 2003, : 1152 - 1155
[28] FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX-MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
Wu, Bang Ye
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (01)
[29] ML-TIPN: An algorithm for automated acquisition of domain models based on time interval Petri Nets
Bulitko, Vadim
Wilkins, David C.
JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2006, 12 (5-6) : 391 - 407
[30] ML-TIPN: An algorithm for automated acquisition of domain models based on time interval Petri Nets
Department of Computing Science, University of Alberta, Edmonton, Alta. T6G 2E8, Canada
不详
J. Mult.-Valued Logic Soft Comput., 2006, 5-6 (391-407):

← 1 2 3 4 →