Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints

  • Yumei Huo
  • Hairong Zhao
Conference paper

DOI: 10.1007/978-3-642-38756-2_33

Volume 7924 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Huo Y., Zhao H. (2013) Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. In: Fellows M., Tan X., Zhu B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg

Abstract

This paper studies bi-criteria scheduling problems on m parallel machines with machine unavailable intervals. The goal is to minimize the total completion time subject to the constraint that the makespan is at most a constant T. We study two different unavailability models. In the first model, each machine has a single unavailable interval which starts from time 0. In the second model, each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. For each model, we show that there is an optimal polynomial time algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yumei Huo
    • 1
  • Hairong Zhao
    • 2
  1. 1.Department of Computer Science, College of Staten IslandCUNYStaten IslandUSA
  2. 2.Department of Mathematics, Computer Science & StatisticsPurdue University CalumetHammondUSA