Abstract
We present in this paper a proof of the NP-completeness of the problem to schedule n simultaneously available jobs on m parallel machines to minimize the weighted sum of machine makespans.
Original language | English |
---|---|
Pages (from-to) | 389-390 |
Number of pages | 2 |
Journal | Applied Mathematics Letters |
Volume | 2 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Jan 1989 |
Externally published | Yes |
ASJC Scopus subject areas
- Applied Mathematics