Approximation Algorithms for Generalized Path Scheduling

• Author / Creator

  Pang, Haozhou

• Scheduling problems are problems to assign jobs to machines at particular times while trying to optimize some objective function. In this work, we study one such problem, called Generalized Path Scheduling (GPS) problem, in which the machines form a path and each job is assigned a subpath of machines to be processed on. We consider minimizing makespan (largest completion time) and/or total completion time and we present several improved approximation algorithms for both objectives.

• Subjects / Keywords

  • Job shop
  • Approximation Algorithms
  • Flow shop
  • Path Scheduling

• Graduation date

  Fall 2020

• Type of Item

  Thesis

• Degree

  Master of Science

• DOI

  https://doi.org/10.7939/r3-f4a6-zy13

• License

  Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.