default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 298
Volume 298, Number 1, March 2021
- Imed Kacem
, Hans Kellerer, Ali Ridha Mahjoub:
Preface: New trends on combinatorial optimization for network and logistical applications. 1-5 - Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On packet scheduling with adversarial jamming and speedup. 7-42 - Xiaoqiang Cai, Xianyi Wu, Xian Zhou:
Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns. 43-64 - Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi:
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. 65-78 - Xing Chai, Wenhua Li, Yuejuan Zhu:
Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. 79-93 - T. C. E. Cheng, Boris Kriheli, Eugene Levner, C. T. Ng:
Scheduling an autonomous robot searching for hidden targets. 95-109 - Philippe Chrétienne:
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times. 111-124 - Isma Dahmani, Mhand Hifi:
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. 125-147 - Gustavo Dias, Leo Liberti:
Exploiting symmetries in mathematical programming via orbital independence. 149-182 - Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, Stéphane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. 183-206 - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
The transportation problem with conflicts. 207-227 - Hüseyin Güden:
New complexity results for the p-hub median problem. 229-247 - Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Online production planning to maximize the number of on-time orders. 249-269 - Danny Hermelin, Shlomo Karhi, Michael L. Pinedo, Dvir Shabtay:
New algorithms for minimizing the weighted number of tardy jobs on a single machine. 271-287 - Mahmoud Heshmat, Amr B. Eltawil:
Solving operational problems in outpatient chemotherapy clinics using mathematical programming and simulation. 289-306 - Guoxuan Huang, Qing Ding, Ciwei Dong, Zhicong Pan:
Joint optimization of pricing and inventory control for dual-channel problem under stochastic demand. 307-337 - Hyun-Jung Kim, Jun-Ho Lee:
Cyclic robot scheduling for 3D printer-based flexible assembly systems. 339-359 - Lingfa Lu, Liqi Zhang, Jinwen Ou:
In-house production and outsourcing under different discount schemes on the total outsourcing cost. 361-374 - Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi:
Exact method for the two-machine flow-shop problem with time delays. 375-406 - Jun Pei, Qingru Song, Baoyu Liao, Xinbao Liu, Panos M. Pardalos:
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration. 407-444 - Alain Quilliot, Antoine Sarbinowski, Hélène Toussaint:
Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system. 445-468 - Alan J. Soper, Vitaly A. Strusevich:
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. 469-495 - Yunqiang Yin, Doudou Li, Dujuan Wang, T. C. E. Cheng:
Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. 497-523 - Ya Xu, Yuquan Du, Yongjian Li, Heng Zhang:
Collaborative emergency berth scheduling based on decentralized decision and price mechanism. 525-554 - Gabriel L. Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao:
On exact solution approaches for bilevel quadratic 0-1 knapsack problem. 555-572
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-24 21:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
