Scheduling a Batch Processor with Unbounded Capacity

Scheduling a Batch Processor with Unbounded Capacity[J]. Journal of East China University of Science and Technology, 2001, (4): 431-433.

Citation:

Scheduling a Batch Processor with Unbounded Capacity[J]. Journal of East China University of Science and Technology, 2001, (4): 431-433.

Citation:

Scheduling a Batch Processor with Unbounded Capacity[J]. Journal of East China University of Science and Technology, 2001, (4): 431-433.

Abstract

The problem of scheduling jobs with release times and due dates on a batch processor with unbounded capacity is considered.Polynomial time algorithms are provided for the case with agreeable release times and due dates and the case with agreeable release times and processing times.NP hardness is established for the case with agreeable processing times and due dates.

FullText(HTML)

Export File