All Stories

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