Pages that link to "Item:Q3892058"

The following pages link to Sequencing independent jobs with a single resource (Q3892058):

Displaying 7 items.

• NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949) (← links)
• Scheduling on machines with variable service rates (Q1094326) (← links)
• One-machine job-scheduling with non-constant capacity -- minimizing weighted completion times (Q1291626) (← links)
• Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
• A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
• Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898) (← links)