All Stories

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