All Stories

  1. Emergency Drone Deployment and Disposable Defibrillator Allocation: A Modular Capacitated Maximum Covering Location Model
  2. Optimal Incentives and the Price of Information in Sequential Production with Private Costs
  3. Welfare-maximizing Budget-balanced Mechanisms for Public Goods
  4. A unified and computationally efficient framework for procurement portfolio optimization with option contracts
  5. Randomized strategyproof mechanisms with best of both worlds fairness and efficiency
  6. Interdisciplinary synergy and integration in auction theory and practice
  7. Stability, Efficiency, and Tractability: Cost-Sharing Trade-offs in Stochastic Congestion Games
  8. Operational Research: methods and applications
  9. Fairness criteria for allocating indivisible chores: connections and efficiencies
  10. An FPTAS for scheduling with resource constraints
  11. Equitability and welfare maximization for allocating indivisible items
  12. An Improved Approximation Algorithm for Scheduling Monotonic Moldable Tasks
  13. Bounding Residence Times for Atomic Dynamic Routings
  14. Capacity Games with Supply Function Competition
  15. Optimizing voting order on sequential juries: a median voter theorem and beyond
  16. Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents
  17. New progress in combinatorial optimization
  18. Preface
  19. Optimizing Voting Order on Sequential Juries: A Sealed Card Model
  20. Buffer sizing in critical chain project management
  21. Scheduling coupled tasks with exact delays
  22. Achieving Efficiency in Capacity Procurement
  23. A functional equation of tail-balance
  24. Rawlsian fairness in supply chains
  25. Incentive schemes for resolving Parkinson’s Law in project management
  26. Atomic congestion games with random players
  27. Price of fairness in scheduling
  28. Scheduling with time-of-use costs
  29. Vehicle Routing with Probabilistic Capacity Constraints
  30. Supplier Competition with Option Contracts for Discrete Blocks of Capacity
  31. A Network Game of Dynamic Traffic
  32. Who Should Cast the Casting Vote?
  33. Combinatorial optimization: theory, computation, and applications
  34. Joint optimization in energy systems
  35. The Importance of Voting Order
  36. Relationships among circumstance pressure, green technology selection and firm performance
  37. Normal-form preemption sequences for an open problem in scheduling theory
  38. Price of anarchy for non-atomic congestion games with stochastic demands
  39. Tactical fixed job scheduling with spread-time constraints
  40. Strong stability of Nash equilibria in load balancing games
  41. Stability vs. optimality in selfish ring routing
  42. Quantifying the efficiency of price-only contracts in push supply chains over demand distributions of known supports
  43. Efficiency analysis of load balancing games with and without activation costs
  44. A comprehensive decision-making model for risk management of supply chain
  45. Algorithmic Aspects in Information and Management
  46. Equilibria in load balancing games
  47. Cost-effective designs of fault-tolerant access networks in communication systems
  48. Logistics scheduling with batching and transportation
  49. On-line service scheduling
  50. The price of atomic selfish ring routing
  51. Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design
  52. Scheduling of batch plants: Constraint-based approach and performance investigation
  53. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
  54. Lot-sizing scheduling with batch setup times
  55. Book review
  56. Algorithm for the Capacitated Facility Location Problem
  57. Algorithms for on-line bin-packing problems with cardinality constraints
  58. On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
  59. Allocation of bandwidth and storage
  60. Optimisation models for re-routing air traffic flows in Europe
  61. On-line scheduling of small open shops
  62. How good is a dense shop schedule?
  63. On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
  64. On-Line Algorithms for Cardinality Constrained Bin Packing Problems
  65. Approximation algorithms for two-machine flow shop scheduling with batch setup times
  66. A Review of Machine Scheduling: Complexity, Algorithms and Approximability
  67. Scheduling on identical machines: How good is LPT in an on-line setting?
  68. An improved heuristic for one-machine scheduling with delays constraints
  69. A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
  70. Scheduling for Three-Machine Flow Shops
  71. An optimal algorithm for preemptive on-line scheduling
  72. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
  73. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
  74. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
  75. A Study of On-Line Scheduling Two-Stage Shops
  76. New lower and upper bounds for on-line scheduling
  77. A lower bound for randomized on-line scheduling algorithms
  78. An optimal algorithm for preemptive on-line scheduling
  79. Scheduling Multiprocessor Flow Shops
  80. A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
  81. Worst-case analysis of heuristics for open shops with parallel machines
  82. A note on LPT scheduling
  83. Approximation Algorithms for Three-Machine Open Shop Scheduling
  84. Tighter bound for MULTIFIT scheduling on uniform processors
  85. Parametric bounds for LPT scheduling on uniform processors
  86. Optimal Binomial Group Testing with a Test History