Pages that link to "Item:Q1019301"

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

Displaying 15 items.

• A composite algorithm for multiprocessor scheduling (Q544815) (← links)
• Scheduling multiprocessor UET tasks of two sizes (Q1034607) (← links)
• The counting complexity of a simple scheduling problem (Q1038110) (← links)
• On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
• The complexity of multidimensional periodic scheduling (Q1281399) (← links)
• Analysis of scheduling problems with typed task systems (Q1331888) (← links)
• Complexity of scheduling problems with multi-purpose machines (Q1374420) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• On the complexity of multiprocessor task scheduling (Q1910619) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• Complexity of a class of task scheduling problems (Q2711272) (← links)
• Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
• Complexity of the Project Sequencing Problem (Q3325432) (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)