Article

Journal of Scheduling

, Volume 14, Issue 1, pp 27-38

Scheduling jobs with equal processing times subject to machine eligibility constraints

  • Kangbok LeeAffiliated withDepartment of Information, Operations & Management Sciences, Stern School of Business, New York University
  • , Joseph Y.-T. LeungAffiliated withDepartment of Computer Science, New Jersey Institute of Technology Email author 
  • , Michael L. PinedoAffiliated withDepartment of Information, Operations & Management Sciences, Stern School of Business, New York University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 scheduling Eligibility constraint Nested and inclusive eligible sets Equal-processing-time jobs Online and offline scheduling Makespan Competitive ratio Worst-case ratio