default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 252
Volume 252, Number 1, May 2017
- Onno J. Boxma, Joris Walraevens
:
Computational methods and applications in queueing theory. 1-2 - Michiel De Muynck, Sabine Wittevrongel, Herwig Bruneel:
Analysis of discrete-time queues with general service demands and finite-support service capacities. 3-28 - Alexander S. Rumyantsev, Evsey Morozov:
Stability criterion of a multiserver model with simultaneous service. 29-39 - Yunbae Kim, Ganguk Hwang:
Delay analysis and optimality of the renewal access protocol. 41-62 - Xi Chen, David J. Worthington:
Staffing of time-varying queues using a geometric discrete time modelling approach. 63-84 - Mehmet Akif Yazici, Nail Akar:
The finite/infinite horizon ruin problem with multi-threshold premiums: a Markov fluid queue approach. 85-99 - Max Tschaikowski, Mirco Tribastone:
A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment. 101-120 - Bara Kim, Jeongsim Kim:
Waiting time distributions in an M/G/1 retrial queue with two classes of customers. 121-134 - Mohan L. Chaudhry, Abhijit Datta Banik, António Pacheco:
A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GI[X]/C-MSP/1/∞. 135-173 - Bart Steyaert, Sabine Wittevrongel, Herwig Bruneel:
Characterisation of the output process of a discrete-time GI/D/1 queue, and its application to network performance. 175-190 - Fátima Ferreira, António Pacheco, Helena Ribeiro:
Moments of losses during busy-periods of regular and nonpreemptive oscillating MX/G/1/n systems. 191-211
Volume 252, Number 2, May 2017
- Ender Özcan, Edmund K. Burke, Barry McCollum:
Preface. 213-214 - Emir Demirovic, Nysret Musliu:
Modeling high school timetabling with bitvectors. 215-238 - Michele Battistutta, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of single-stage simulated annealing for examination timetabling. 239-254 - Alexander Kiefer, Richard F. Hartl, Alexander Schnell:
Adaptive large neighborhood search for the curriculum-based course timetabling problem. 255-282 - Antony E. Phillips, Cameron G. Walker, Matthias Ehrgott, David M. Ryan:
Integer programming for minimal perturbation problems in university course timetabling. 283-304 - Oliver G. Czibula, Hanyu Gu, Aaron Russell, Yakov Zinder:
A multi-stage IP-based heuristic for class timetabling and trainer rostering. 305-333 - Christopher Bayliss, Geert De Maere, Jason A. D. Atkin, Marc Paelinck:
A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty. 335-363 - Alex Bonutti, Sara Ceschia, Fabio De Cesco, Nysret Musliu, Andrea Schaerf:
Modeling and solving a real-life multi-skill shift design problem. 365-382 - Ralf Borndörfer, Guillaume Sagnol, Thomas Schlechte, Elmar Swarat:
Optimal duty rostering for toll enforcement inspectors. 383-406 - Broos Maenhout, Mario Vanhoucke:
A resource type analysis of the integrated project scheduling and personnel staffing problem. 407-433 - Daniel Karapetyan, Jason A. D. Atkin, Andrew J. Parkes, Juan Castro-Gutierrez:
Lessons from building an automated pre-departure sequencer for airports. 435-453 - Tal Grinshpoun, Hagai Ilani, Elad Shufan:
The representation of partially-concurrent open shop problems. 455-469
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 2024-11-15 19:39 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:
