Pages that link to "Item:Q744634"

The following pages link to Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634):

Displaying 22 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
• Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
• Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
• Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
• Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
• Two-agent scheduling in a two-machine open shop (Q6491675) (← links)
• Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines (Q6593671) (← links)
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)