On a scheduling problem where a job can be executed only by a limited number of processors

  • Chang R
  • Lee R
  • 2


    Mendeley users who have this article in their library.
  • 19


    Citations of this article.


In this paper we consider a job scheduling problem where each job can be executed only by a subset of available processors. This problem arises when we are scheduling a set of cannons to be fired on a set of targets. Each cannon can destroy only a subset of targets and we want the targets to be destroyed in the shortest possible time. We define what is meant by a balanced solution. We then consider three problems: How can we detect that there is a balanced solution? If this solution exists, find such a solution. If no such solution exists, find an optimal assignment which minimizes the makespan. We show that there are polynomial time algorithms to solve these problems. © 1988.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • R. S. Chang

  • R. C.T. Lee

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free