Scheduling with uncertain resources: Search for a near-optimal solution

被引：7
作者：
Fink, Eugene [1 ]
Jennings, P. Matthew [1 ]
Bardak, Ulas [1 ]
Oh, Jean [1 ]
Smith, Stephen F. [1 ]
Carbonell, Jaime G. [1 ]
机构：
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源：
2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS | 2006年
关键词：
D O I：
10.1109/ICSMC.2006.384372
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We describe a system for scheduling a conference based on incomplete information about available resources and scheduling constraints. We explain the representation of uncertain knowledge, describe a local-search algorithm for generating near-optimal schedules, and give empirical results of automated scheduling under uncertainty.
引用
收藏
页码：137 / +
页数：2
相关论文
共 50 条
[21]   Search trees with relaxed balance and near-optimal height [J].
Fagerberg, R ;
Jensen, RE ;
Larsen, KS .
ALGORITHMS AND DATA STRUCTURES, 2001, 2125 :414-425
[22]   Behavior and neural basis of near-optimal visual search [J].
Wei Ji Ma ;
Vidhya Navalpakkam ;
Jeffrey M Beck ;
Ronald van den Berg ;
Alexandre Pouget .
Nature Neuroscience, 2011, 14 :783-790
[23]   Learning to search efficiently for causally near-optimal treatments [J].
Hakansson, Samuel ;
Lindblom, Viktor ;
Gottesman, Omer ;
Johansson, Fredrik D. .
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
[24]   A Near-Optimal Analytic Solution to the Optimal Lead Turn Problem [J].
Stephens, Shawn S. ;
Casbeer, David W. ;
Kunz, Donald L. ;
Baker, William P. ;
Hess, Joshuah A. .
AIAA SCITECH 2021 FORUM, 2021,
[25]   Near-optimal packet scheduling scheme in satellite LTE networks [J].
Aiyetoro, Gbolahan ;
Takawira, Fambirai ;
Walingo, Tom .
IET COMMUNICATIONS, 2017, 11 (15) :2311-2319
[26]   Distributed SBP Cholesky Factorization Algorithms with Near-Optimal Scheduling [J].
Gustavson, Fred G. ;
Karlsson, Lars ;
Kagstrom, Bo .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2009, 36 (02)
[27]   Near-Optimal Scheduling for Petri Net Models With Forbidden Markings [J].
Lefebvre, Dimitri .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (08) :2550-2557
[28]   Near-Optimal Traveling Salesman Solution with Deep Attention [J].
Kafakthong, Natdanai ;
Sinapiromsaran, Krung .
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2024, 15 (12) :954-963
[29]   Near-Optimal Scheduling based on Immune Algorithms in Distributed Environments [J].
Istin, Mihai ;
Visan, Andreea ;
Pop, Florin ;
Dobre, Ciprian ;
Cristea, Valentin .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010), 2010, :439-444
[30]   Near-optimal solution to an employee assignment problem with seniority [J].
Hojati, Mehran .
ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) :539-557
12345