Pages that link to "Item:Q1329790"

The following pages link to Minimizing the weighted number of tardy task units (Q1329790):

Displaying 20 items.

• Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
• A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
• Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
• Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity (Q1274741) (← links)
• Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
• A metric for total tardiness minimization (Q2362385) (← links)
• Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines (Q2806872) (← links)
• (Q3362479) (← links)
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)
• IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS (Q4667921) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)