Pages that link to "Item:Q581214"

The following pages link to Minimizing mean weighted execution time loss on identical and uniform processors (Q581214):

Displaying 22 items.

• Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
• A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
• Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
• Scheduling two agents with controllable processing times (Q976351) (← links)
• Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
• Minimizing the weighted number of tardy task units (Q1329790) (← links)
• Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
• Open shop scheduling problems with late work criteria. (Q1421458) (← links)
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
• Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
• Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← 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)
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)
• Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
• A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work (Q6054012) (← 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)