Pages that link to "Item:Q2197329"

The following pages link to Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329):

Displaying 20 items.

• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← 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)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
• Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans (Q2410095) (← links)
• Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• (Q2951304) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
• A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← 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)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)