All Stories

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