Pages that link to "Item:Q2029301"

The following pages link to Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301):

Displaying 16 items.

• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
• Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
• A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467) (← links)
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
• (Q5234786) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← 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 scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• Integrated production and transportation scheduling problem under nonlinear cost structures (Q6555171) (← links)
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)