Upper bounds for Revenue maximization in a Satellite Scheduling problem

被引：6

作者：

Benoist T. ^{[1
,2
]}

Rottembourg B. ^{[1
]}

机构：

[1] Bouygues e-lab, 78061 St Quentin en Yvelines Cedex

[2] Laboratoire Informatique d'Avignon CNRS FRE 2487, Avignon Cedex, 84911

来源：

Quarterly Journal of the Belgian, French and Italian Operations Research Societies | 2004年 / 2卷 / 3期

关键词：

Concave costs; Russian Dolls; Upper bounds; Valid inequalities;

D O I：

10.1007/s10288-004-0044-8

中图分类号：

学科分类号：

摘要：

This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem with Time Windows is defined and enriched with valid inequalities based on task interval reasoning. The non-concavity of the objective function to be maximized is also studied. Finally a Russian Dolls approach combines bounds on nested sub-problems. These first upper bounds for the SRSS problem are compared to best known solutions of the benchmark of the optimization challenge organized by the French OR society. © Springer-Verlag 2004.

引用

页码：235 / 249

页数：14

共 50 条

[21] Traffic-Matching Revenue-Rate Maximization Scheduling for Downlink OFDMA
Ma, Yao
Leith, Alex
Qian, Yi
2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 4315 - +
[22] UPPER AND LOWER BOUNDS FOR THE DICTIONARY PROBLEM
DIETZFELBINGER, M
MEHLHORN, K
HEIDE, FM
ROHNERT, H
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 214 - 215
[23] SALES REVENUE MAXIMIZATION
WAVERMAN, L
JOURNAL OF INDUSTRIAL ECONOMICS, 1968, 17 (01): : 73 - 77
[24] MARGINAL COST AND MARGINAL REVENUE IN ELEMENTARY TREATMENT OF PROBLEM OF PROFIT MAXIMIZATION
DICKSON, H
SWEDISH JOURNAL OF ECONOMICS, 1969, 71 (02): : 127 - 131
[25] LOWER BOUNDS FOR THE SCHEDULING PROBLEM WITH UNCERTAIN DEMANDS
Berkoune, Djamel
Mesghouni, Khaled
Rabenasolo, Besoa
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2006, 16 (02) : 263 - 269
[26] SCHEDULING PROBLEM IN SATELLITE COMMUNICATIONS SYSTEMS
AHARA, C
ROSSBACH, J
IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1967, CO15 (03): : 364 - &
[27] Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
Zheng, Shuang
He, Zhengwen
Yang, Zhen
Chu, Chengbin
Wang, Nengmin
COMPUTERS & OPERATIONS RESEARCH, 2023, 153
[28] Upper Bounds on Taillard's Benchmark Suite for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
Pan, Quan-Ke
Tasgetiren, Fatih
Liang, Yun-Chia
Suganthan, P. N.
2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 2955 - +
[29] On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization
Zhou, Chuan
Zhang, Peng
Zang, Wenyu
Guo, Li
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (10) : 2770 - 2783
[30] ALTERNATIVE DYNAMIC-PROGRAMMING APPROACHES TO OBTAIN UPPER-BOUNDS FOR THE ECONOMIC LOT SCHEDULING PROBLEM
AXSATER, S
ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1982, 6 (APR): : 17 - 23

← 1 2 3 4 5 →