A well-known technique for solving scheduling problems with two identical parallel processors and unit execution time jobs under a makespan minimization criteria involves finding maximum cardinality matchings in the graph associated with the problem, and then using these matchings to create optimal schedules. For some problem instances, however, this method will not work, since the problems are NP-hard. In this note, a previously open problem involving additional resource constraints is shown to have a polynomial algorithm using cardinality matching method.
|Original language||English (US)|
|Number of pages||5|
|State||Published - 1998|
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research