Two dimensional load balancing

Kangbok Lee, Joseph Y.T. Leung, Michael L. Pinedo

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We consider a bi-criteria parallel machine scheduling problem in which the first objective is the minimization of the makespan of the schedule and the second objective is the minimization of the maximum machine cost. Since the problem is strongly NP-hard, we propose a fast heuristic and derive its worst-case performance bound.

Original languageEnglish (US)
Pages (from-to)539-544
Number of pages6
JournalOperations Research Letters
Issue number8
StatePublished - Dec 2014

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


  • Heuristics
  • Makespan
  • Maximum machine cost
  • NP-hard
  • Parallel machines
  • Two dimensional load balancing


Dive into the research topics of 'Two dimensional load balancing'. Together they form a unique fingerprint.

Cite this