All Stories

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