Highly Influenced

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

@article{Chang1988OnAS, title={On a scheduling problem where a job can be executed only by a limited number of processors}, author={R. S. Chang and Richard C. T. Lee}, journal={Computers & OR}, year={1988}, volume={15}, pages={471-478} }

- Published 1988 in Computers & OR
DOI:10.1016/0305-0548(88)90063-9

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 tired 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… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

12 Extracted Citations

8 Extracted References

Similar Papers

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-8 of 8 references