Polynomial algorithms for scheduling jobs with two processing times on unrelated machines

  • Nodari Vakhania, Frank Werner
  • IFAC Proceedings Volumes, May 2012, Elsevier
  • DOI: 10.3182/20120523-3-ro-2023.00055

What is it about?

We propose a polynomial-time algorithm that solves the problem of scheduling jobs with only two possible specific processing times p and 2p on unrelated machines with the objective to minimize the maximal job completion time.

Read Publication

http://dx.doi.org/10.3182/20120523-3-ro-2023.00055

The following have contributed to this page: Prof. Dr. Frank Werner