Sequential scheduling on identical machines

Refael Hassin*, Uri Yovel

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study a sequential version of the KP-model: Each of n agents has a job to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the completion time of his machine. We study the sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insights into the case of two unrelated machines.

Original languageEnglish
Pages (from-to)530-533
Number of pages4
JournalOperations Research Letters
Issue number5
StatePublished - 1 Sep 2015


  • Congestion games
  • Load balancing
  • Machine scheduling
  • Makespan minimization
  • Sequential price of anarchy
  • Subgame-perfect equilibrium


Dive into the research topics of 'Sequential scheduling on identical machines'. Together they form a unique fingerprint.

Cite this