All Stories

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