| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142438 | Operations Research Letters | 2014 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo,