Journal of Scheduling

, Volume 14, Issue 1, pp 27–38

Scheduling jobs with equal processing times subject to machine eligibility constraints

  • Kangbok Lee
  • Joseph Y.-T. Leung
  • Michael L. Pinedo
Article

DOI: 10.1007/s10951-010-0190-0

Cite this article as:
Lee, K., Leung, J.YT. & Pinedo, M.L. J Sched (2011) 14: 27. doi:10.1007/s10951-010-0190-0

Abstract

We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed, called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as well as approximation algorithms with good competitive ratios.

Keywords

Parallel machine schedulingEligibility constraintNested and inclusive eligible setsEqual-processing-time jobsOnline and offline schedulingMakespanCompetitive ratioWorst-case ratio

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Kangbok Lee
    • 1
  • Joseph Y.-T. Leung
    • 2
  • Michael L. Pinedo
    • 1
  1. 1.Department of Information, Operations & Management Sciences, Stern School of BusinessNew York UniversityNew YorkUSA
  2. 2.Department of Computer ScienceNew Jersey Institute of TechnologyNewarkUSA