Pages that link to "Item:Q1019301"

The following pages link to Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301):

Displaying 2 items.

• Scheduling multiprocessor UET tasks of two sizes (Q1034607) (← links)
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)