All Stories

  1. A generic approach to conference scheduling with integer programming
  2. Efficient Scheduling of GECCO Conferences using Hyper-heuristic Algorithms
  3. A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem
  4. Generalisations of a Bayesian decision-theoretic randomisation procedure and the impact of delayed responses
  5. On model-based time trend adjustments in platform trials with non-concurrent controls
  6. Routing with too much information?
  7. Bandit Procedures for Designing Patient-Centric Clinical Trials
  8. A Novel Implementation of Q-Learning for the Whittle Index
  9. Performance evaluation of scheduling policies for the dynamic and stochastic resource-constrained multi-project scheduling problem
  10. On the dynamic allocation of assets subject to failure
  11. Performance Evaluation of Scheduling Policies for the DRCMPSP
  12. A Bayesian adaptive design for clinical trials in rare diseases
  13. Optimal dynamic resource allocation to prevent defaults
  14. Tie-breaking can maximize fairness without sacrificing throughput in D2D-assisted networks
  15. Nearly-optimal scheduling of users with Markovian time-varying transmission rates
  16. Scheduling of multi-class multi-server queueing systems with abandonments
  17. Floating band D2D: Exploring and exploiting the potentials of adaptive D2D-enabled networks
  18. Maximal flow‐level stability of best‐rate schedulers in heterogeneous wireless systems
  19. Modeling D2D communications with LTE and WiFi
  20. An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels
  21. Opportunistic scheduling of flows with general size distribution in wireless time-varying channels
  22. Optimal planning of slow-ramping power production in energy systems with renewables forecasts and limited storage
  23. Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
  24. Congestion control of TCP flows in Internet routers by means of index policy
  25. Scheduling of users with markovian time-varying transmission rates
  26. Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
  27. Optimal anticipative congestion control of flows with time-varying input stream
  28. Optimal congestion control of TCP flows for internet routers
  29. Optimal Index Rules for Single Resource Allocation to Stochastic Dynamic Competitors
  30. Value of information in optimal flow-level scheduling of users with Markovian time-varying channels
  31. Resource-sharing in a single server with time-varying capacity
  32. A nearly-optimal index rule for scheduling of users with abandonment
  33. A modeling framework for optimizing the flow-level scheduling with time-varying channels
  34. Admission Control and Routing to Parallel Queues with Delayed Information via Marginal Productivity Indices
  35. Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
  36. Distance Coloring of the Hexagonal Lattice